scientific article; zbMATH DE number 3843789

MaRDI QIDQ3313893zbMATH OpenFDO

Authors David Kadleček, Frank Harary, C. Hoede

Publication date 1982

zbMATH Keywords

distance n-graphgeodesic pathn-path graphn-step graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Recommendations

• On Properties of a Graph that Depend on its Distance Function
• Intervals and steps in a connected graph
• On the radius of neighborhood graphs
• scientific article; zbMATH DE number 434483
• An axiomatic approach to metric properties of connected graphs

Cited in

(8)

• Switching invariant two-path signed graphs
• Graphs having distance-\(n\) domination number half their order
• Graph equation for line graphs and \(m\)-step graphs
• On Properties of a Graph that Depend on its Distance Function
• Characterizing 2-distance graphs
• On the radius of neighborhood graphs
• Graphs with parity conditions on distances between cut and noncut vertices
• Connectivity of 3-distance graphs

This page was built for publication:

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