Node and link vulnerability in complete multipartite networks

DOI10.1142/s0129054123500077zbMATH Open1541.05163MaRDI QIDQ6554732

Aysun Aytaç, Zeynep Nihan Odabaş Berberler

Publication date: 13 June 2024

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

zbMATH Keywords

diametervulnerabilitycomplex networksTurán graphsnetwork design and communicationcloseness

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12) Connectivity (05C40) Density (toughness, etc.) (05C42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eigenvalues of complete multipartite graphs
• Tenacity and rupture degree of permutation graphs of complete bipartite graphs
• Recognizing tough graphs is NP-hard
• On a class of posets and the corresponding comparability graphs
• Measuring the vulnerability for classes of intersection graphs
• Connectivity and edge-disjoint spanning trees
• Tough graphs and Hamiltonian circuits.
• Eine Extremalaufgabe aus der Graphentheorie.
• Residual Closeness in Cycles and Related Networks
• RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKS
• RESIDUAL CLOSENESS AND GENERALIZED CLOSENESS
• Network robustness and residual closeness
• Robustness of Regular Caterpillars
• Link Vulnerability in Networks
• Residual Closeness of Generalized Thorn Graphs
• Edge‐tenacious networks
• Computing the Scattering Number of Graphs
• Turan's Graph Theorem
• A Note on the Link Residual Closeness of Graphs Under Join Operation
• Rupture degree of graphs
• On the Invulnerability of the Regular Complete k-Partite Graphs
• Extremal Results on Vertex and Link Residual Closeness

This page was built for publication: Node and link vulnerability in complete multipartite networks