Degree sequence of tight distance graphs

DOI10.1016/J.ENDM.2009.11.054MaRDI QIDQ2840558zbMATH OpenOpenAlexFDO

Authors Martin Matamala, José Zamora

Publication date 19 July 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2009.11.054

zbMATH Keywords

degree sequencetight distance graphs

Mathematics Subject Classification ID

Vertex degrees (05C07) Structural characterization of families of graphs (05C75)

Recommendations

• Tight distance-regular graphs
• scientific article; zbMATH DE number 1379441
• Graphs whose vertices are graphs with bounded degree: Distance problems
• Publication:3203049
• scientific article; zbMATH DE number 3855166

Cites work

• scientific article; zbMATH DE number 3169205 (Why is no real title available?)
• scientific article; zbMATH DE number 3752901 (Why is no real title available?)
• scientific article; zbMATH DE number 2192215 (Why is no real title available?)
• Distance Graphs on the Integers
• Split graphs
• The splittance of a graph

This page was built for publication: Degree sequence of tight distance graphs

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