𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Equivalence of four descriptions of generalized line graphs

✍ Scribed by G. R. Vijayakumar

Publisher
John Wiley and Sons
Year
2010
Tongue
English
Weight
284 KB
Volume
67
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

A new characterization of generalized line graphs, analogous to that of line graphs found by Van Rooij and Wilf [Acta Math Acad Sci Hungar 16 (1965), 263-269] is obtained. By a cycle of implications, we settle the equivalence of the definition of generalized line graph given by Hoffman [Combinatorial Structures and their Applications, Gordon and

πŸ“œ SIMILAR VOLUMES

On ?-equivalence and ?-equivalence of gr
On ?-equivalence and ?-equivalence of graphs
✍ Du, Qingyan πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 336 KB πŸ‘ 1 views

W e define a partial ordering on the set of a-polynomials as well as a vertex splitting operation on the set of graphs, and introduce the notions of (r-equivalence and (r- uniqueness of graphs. Let a ( G ) be the a-polynomial of a graph G and a ( G ) = (r(GC). Let H = (G, u , A, 5) be a vertex spli

A common generalization of line graphs a
A common generalization of line graphs and clique graphs
✍ Erich Prisner πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 664 KB

## Abstract Both the line graph and the clique graph are defined as intersection graphs of certain families of complete subgraphs of a graph. We generalize this concept. By a __k__‐edge of a graph we mean a complete subgraph with __k__ vertices or a clique with fewer than __k__ vertices. The __k__‐

Generating all planer graphs regular of
Generating all planer graphs regular of degree four
✍ Paolo Manca πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 225 KB πŸ‘ 1 views

## Abstract All planar connected graphs regular of degree four can be generated from the graph of the octahedron, using four operations.

Semisymmetry of Generalized Folkman Grap
Semisymmetry of Generalized Folkman Graphs
✍ Dragan MaruΕ‘ič; PrimoΕΎ Potočnik πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 221 KB
Generalized Pigeonhole Properties of Gra
Generalized Pigeonhole Properties of Graphs and Oriented Graphs
✍ Anthony Bonato; Peter J Cameron; Dejan DeliΔ‡; StΓ©phan ThomassΓ© πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 152 KB

A relational structure A satisfies the P(n, k) property if whenever the vertex set of A is partitioned into n nonempty parts, the substructure induced by the union of some k of the parts is isomorphic to A. The P(2, 1) property is just the pigeonhole property, (P), introduced by Cameron, and studied