Residual closeness of wheels and related networks

DOI10.1142/S0129054111008660MaRDI QIDQ3173947zbMATH OpenOpenAlexFDO

Authors Zeynep Nihan Odabaş, Aysun Aytaç

Publication date 10 October 2011

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054111008660

zbMATH Keywords

connectivityfriendship graphclosenessgraph vulnerabilitygear graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Network design and communication in computer systems (68M10)

Recommendations

• Residual closeness for helm and sunflower graphs
• Residual closeness and generalized closeness
• Link vulnerability in networks
• Vulnerability of Mycielski graphs via residual closeness.
• Residual closeness in cycles and related networks

Cites work

• Graph Classes: A Survey
• Graph theory with applications
• On a class of posets and the corresponding comparability graphs
• The binding number of a graph and its Anderson number
• Tough graphs and Hamiltonian circuits.

Cited in

(22)

• Link Residual Closeness of Harary Graphs
• Residual closeness of graphs with given parameters
• Node and link vulnerability in complete multipartite networks
• Residual closeness of generalized thorn graphs
• Network robustness and residual closeness
• Computing closeness for some graphs
• Residual closeness and generalized closeness
• On the residual closeness of graphs with cut vertices
• Closeness and vertex residual closeness of Harary graphs
• scientific article; zbMATH DE number 6770087 (Why is no real title available?)
• Determining vulnerability of central networks using closeness and Nordhaus-Gaddum type relation
• Link vulnerability in networks
• Exponential independence number of some graphs
• Robustness of regular caterpillars
• Vertex and link residual closeness of graphs of given fractional matching number
• The 2-extra connectivity of wheel networks
• Additional closeness and networks growth
• Residual closeness for helm and sunflower graphs
• Vulnerability of Mycielski graphs via residual closeness.
• Residual closeness in cycles and related networks
• Additional Closeness of Cycle Graphs
• Extremal Results on Vertex and Link Residual Closeness

This page was built for publication: Residual closeness of wheels and related networks

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