Connected graphs switching equivalent to their iterated line graphs

DOI10.1016/0012-365X(82)90197-2zbMath0497.05052OpenAlexW1975871712MaRDI QIDQ1170205

Belmannu Devadas Acharya

Publication date: 1982

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(82)90197-2

zbMATH Keywords

line graphgraph-equationswitching equivalent

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99)

Related Items (1)

An Algorithmic Characterization of sigraphs whose second iterated line sigraphs and common-edge sigraphs are switching equivalent

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel concepts in graph theory
• Counting balanced signed graphs using marked graphs
• Consistent graphs with signed points
• Enumeration of graphs with signed points and lines
• On Repeated Interchange Graphs

This page was built for publication: Connected graphs switching equivalent to their iterated line graphs