✦ LIBER ✦

On neighbourhood line graphs

✍ Scribed by Xingxing Yu

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 987 KB
Volume: 91
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90238-d

No coin nor oath required. For personal study only.

✦ Synopsis

Yu, X., On neighbourhood line graphs, Discrete Mathematics 91 (1991) 295-309.

In this paper we study relationships between neighbourhood line graphs and a certain type of design. We answer some questions posed by Neumaier (41.

📜 SIMILAR VOLUMES

On minimal neighbourhood-connected graph

On minimal neighbourhood-connected graphs

✍ Bert L. Hartnell; William Kocay 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 809 KB

Hartnell, B.L. and W. Kocay, On minimal neighbourhood-connected graphs, Discrete Mathematics 92 (1991) 95-105. The closed neighbourhood of a vertex u of a graph G is u\* = {v 1 v is adjacent to u} U {u}. G is neighbourhood-connected if it is connected, and G -u' is connected but not complete, for al

Graph theoretical clustering based on li

Graph theoretical clustering based on limited neighbourhood sets

✍ Roderick Urquhart 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 1003 KB

Neighbourhood Graphs of Cayley Graphs fo

Neighbourhood Graphs of Cayley Graphs for Finitely-generated Groups

✍ Markus Neuhauser 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 134 KB

In this short note the neighbourhood graph of a Cayley graph is considered. It has, as nodes, a symmetric generating set of a finitely-generated group . Two nodes are connected by an edge if one is obtained from the other by multiplication on the right by one of the generators. Two necessary conditi

Second neighbourhoods of strongly regula

Second neighbourhoods of strongly regular graphs

✍ A.D. Gardiner; C.D. Godsil; A.D. Hensel; Gordon F. Royle 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 723 KB

## Some antipodal distance-regular graphs of diameter three arise as the graph induced by the vertices at distance two from a given vertex in a strongly regular graph. We show that if every vertex in a strongly regular graph G has this property, then G is the noncollinearity graph of a special typ

On subpancyclic line graphs

✍ Xiong, Liming 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB 👁 1 views

We give a best possible Dirac-like condition for a graph G so that its line graph L(G) is subpancyclic, i.e., L(G) contains a cycle of length l for each l between 3 and the circumference of G. The result verifies the conjecture posed by Xiong (Pancyclic results in hamiltonian line graphs, in:

On hamiltonian line graphs

✍ Lane Clark 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB