Distance independence in graphs

DOI10.7151/DMGT.1554MaRDI QIDQ3089363zbMATH OpenOpenAlexFDO

Authors J. Louis Sewell, Peter Slater

Publication date 24 August 2011

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/dmgt.1554

zbMATH Keywords

distance setindependence number

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Different-distance sets in a graph
• Independence and average distance in graphs
• scientific article; zbMATH DE number 844146
• The average distance and the independence number
• scientific article; zbMATH DE number 638684

Cited in

(5)

• On local and global independence numbers of a graph
• scientific article; zbMATH DE number 5016709 (Why is no real title available?)
• Generalization of bipartite graphs
• Independence numbers of Johnson-type graphs
• Distance independence polynomial of graphs

This page was built for publication: Distance independence in graphs

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