✦ LIBER ✦

Permanental roots and the star degree of a graph

✍ Scribed by Isabel Faria

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 398 KB
Volume: 64
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(85)90281-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The irredundance number and maximum degr

The irredundance number and maximum degree of a graph

✍ B. Bollobás; E.J. Cockayne 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 104 KB

A vertex x in a subset X of vertices of an undirected graph is redundant if its dosed neighborhood is contained in the union of closed neighborhoods of vertices of X-{x}. In the context of a communications network, this means that any vertex that may receive communications from X may also be irdorme

A degree condition for the circumference

A degree condition for the circumference of a graph

✍ Nathaniel Dean; Pierre Fraisse 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB 👁 1 views

We present a new condition on the degree sums of a graph that implies the existence of a long cycle. Let c(G) denote the length of a longest cycle in the graph G and let rn be any positive integer. Suppose G is a 2-connected graph with vertices x,, . . . , x, and edge set E that satisfies the proper

The star chromatic number of a graph

✍ H. L. Abbott; B. Zhou 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 469 KB 👁 2 views

## Abstract We study a generalization of the notion of the chromatic number of a graph in which the colors assigned to adjacent vertices are required to be, in a certain sense, far apart. © 1993 John Wiley & Sons, Inc.

Innate degree of freedom of a graph

✍ D. J. Klein; M. Randić 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 433 KB

For a Kekul6 structure we consider the smallest number of placements of double bonds such that the full Kekul6 structure on the given parent graph is fully determined. These numbers for each Kekul6 structure of the parent graph sum to a novel structural invariant F, called the degree of freedom of t

A family of graphs and the degree/diamet

A family of graphs and the degree/diameter problem

✍ Geoffrey Exoo 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 64 KB 👁 1 views

## Abstract We investigate a family of graphs relevant to the problem of finding large regular graphs with specified degree and diameter. Our family contains the largest known graphs for degree/diameter pairs (3, 7), (3, 8), (4, 4), (5, 3), (5, 5), (6, 3), (6, 4), (7, 3), (14, 3), and (16, 2). We a

The distribution of the maximum degree o

The distribution of the maximum degree of a random graph

✍ Béla Bollobás 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 184 KB

Consider I:andom graphs with n labelled vertices in which the edges are chosen independently and with a 6lxed probability p, 0 <p C 1. Let y be a fixed real number, q = 1p, and denote by A the maximum degree. Then