Maximum degree growth of the iterated line graph

zbMATH Open0920.05058MaRDI QIDQ1295988FDOQ1295988

Authors: Stephen G. Hartke, Aparna W. Higgins 

Publication date: 8 July 1999

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/119895

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• scientific article; zbMATH DE number 2197898
• Connectivity of iterated line graphs
• Iterated line graphs are maximally ordered
• Bounds on the connectivity of iterated line graphs

zbMATH Keywords

line graphmaximum degree

Mathematics Subject Classification ID

Distance in graphs (05C12) Structural characterization of families of graphs (05C75)

Cited In (9)

• Title not available (Why is that?)
• Iterated open neighborhood graphs and generalizations
• The Wiener index in iterated line graphs
• Iterated line graphs are maximally ordered
• Connectivity of iterated line graphs
• On growth triangular graphs
• Linkability in iterated line graphs
• Bounds on the connectivity of iterated line graphs
• Index of parameters of iterated line graphs

This page was built for publication: Maximum degree growth of the iterated line graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1295988)