A note on vulnerability in graphs of diameter five(II)

DOI10.1007/S11741-005-0041-YMaRDI QIDQ3368139zbMATH OpenOpenAlexFDO

Authors Chengde Xu

Publication date 27 January 2006

Published in Journal of Shanghai University (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11741-005-0041-y

zbMATH Keywords

diameter-stable graphisomorphicline persistenceshort \((x,y)\)-path

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Recommendations

• Vulnerability in graphs of diameter five
• Vulnerability of communication networks
• scientific article; zbMATH DE number 3961652
• Vulnerability in graphs of diameter four
• New bounds on the diameter vulnerability of iterated line digraphs

Cites work

• Graph theory with applications
• Graphs as models of communication network vulnerability: Connectivity and persistence
• scientific article; zbMATH DE number 3577229 (Why is no real title available?)
• On a measure of communication network vulnerability
• Vulnerability in graphs of diameter five
• Vulnerability in graphs of diameter four

Cited in

(4)

• Vulnerability of communication networks
• scientific article; zbMATH DE number 3961652 (Why is no real title available?)
• Vulnerability in graphs of diameter five
• New bounds on the diameter vulnerability of iterated line digraphs

This page was built for publication: A note on vulnerability in graphs of diameter five(II)

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