✦ LIBER ✦

On recognizing graph properties from adjacency matrices

✍ Scribed by Ronald L. Rivest; Jean Vuillemin

Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 614 KB
Volume: 3
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(76)90053-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bipartite graphs obtained from adjacency

Bipartite graphs obtained from adjacency matrices of orientations of graphs

✍ K.B. Reid 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 630 KB

If G denotes a graph of order n, then the adjacency matf;ix of an orientation G of G can be thought of as the adjacency matrix of a bipartite graph B(G) of order 2n, where the rows and columns correspond to the bipartition of B(G). For agraph H, let k(H) denote the number of connected components of

On an adjacency property of graphs

✍ Geoffrey Exoo 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 374 KB

## Abstract A graph __G__ has property __A(m, n, k)__ if for any sequence of __m__ + __n__ distinct points of __G__, there are at least __k__ other points, each of which is adjacent to the first __m__ points of the sequence but not adjacent to any of the latter __n__ points. the minimum order among

On the adjacency properties of paley gra

On the adjacency properties of paley graphs

✍ W. Ananchuen; L. Caccetta 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 614 KB

In the application of graph theory to problems arising in network design, the requirements of the network can be expressed in terms of restrictions on the values of certain graph parameters such as connectivity, edge-connectivity, diameter, and independence number. In this paper, we focus on network

Graphs with the n-e.c. adjacency propert

Graphs with the n-e.c. adjacency property constructed from resolvable designs

✍ Catharine A. Baker; Anthony Bonato; Neil A. McKay; Paweł Prałat 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB

## Abstract Only recently have techniques been introduced that apply design theory to construct graphs with the __n__‐e.c. adjacency property. We supply a new random construction for generating infinite families of finite regular __n__‐e.c. graphs derived from certain resolvable Steiner 2‐designs.

On cubic polyhedral graphs with prescrib

On cubic polyhedral graphs with prescribed adjacency properties of their faces

✍ Peter Smutný; Michal Tkáč 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 433 KB

We consider classes of cubic polyhedral graphs whose non-q-gonal faces are adjacent to qgonal faces only. Structural properties of some classes of such graphs are described. For q 5 we show that all the graphs in this class are cyclically 4-edge-connected. Some cyclically 4edge-connected and cyclica

On 2-factorizations of the complete grap

On 2-factorizations of the complete graph: From the k-pyramidal to the universal property

✍ Simona Bonvicini; Giuseppe Mazzuoccolo; Gloria Rinaldi 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB 👁 1 views

## Abstract We consider 2‐factorizations of complete graphs that possess an automorphism group fixing __k__⩾0 vertices and acting sharply transitively on the others. We study the structures of such factorizations and consider the cases in which the group is either abelian or dihedral in some more d