✦ LIBER ✦

Connected graphs switching equivalent to their iterated line graphs

✍ Scribed by B. Devadas Acharya

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 660 KB
Volume: 41
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(82)90197-2

No coin nor oath required. For personal study only.

✦ Synopsis

Dedlcared m my father on his 64th birthday of

In this paper, the problem of determining graphs which are switching cqulvaknt to at least their iterated lme graphs is considered, and such connected graphs are characterized.

📜 SIMILAR VOLUMES

Graphs isomorphic to subgraphs of their

Graphs isomorphic to subgraphs of their line-graphs

✍ Douglas Bauer; Ralph Tindell 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 621 KB

## An emhdding of graph G into graph N is by definition an isomorphism OI G onto a subgraph of H. It is shown in this paper that every unicycle V embeds in its line-graph L(V), and that every other connected graph that embeds in its own line-graph may be constructed from such an embedded unicycle