Node and link vulnerability in complete multipartite networks
type: Item
instance of: scholarly article
title: Node and link vulnerability in complete multipartite networks
zbMATH Open document ID: 1541.05163
author: Zeynep Nihan Odabaş Berberler
author: Aysun Aytaç
published in: International Journal of Foundations of Computer Science
publication date: 2024-06-13T00:00:00Z
Mathematics Subject Classification ID: 05C82
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C42
zbMATH DE Number: 7864524
zbMATH Keywords: complex networks
zbMATH Keywords: network design and communication
zbMATH Keywords: vulnerability
zbMATH Keywords: closeness
zbMATH Keywords: diameter
zbMATH Keywords: Turán graphs
MaRDI profile type: Publication
cites work: Q4641786
cites work: Robustness of Regular Caterpillars
cites work: Network robustness and residual closeness
cites work: RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKS
cites work: Edge‐tenacious networks
cites work: Extremal Results on Vertex and Link Residual Closeness
cites work: Q3789603
cites work: RESIDUAL CLOSENESS AND GENERALIZED CLOSENESS
cites work: Residual Closeness of Generalized Thorn Graphs
cites work: Eigenvalues of complete multipartite graphs
cites work: Recognizing tough graphs is NP-hard
cites work: Connectivity and edge-disjoint spanning trees
cites work: Measuring the vulnerability for classes of intersection graphs
cites work: Q3097134
cites work: A Note on the Link Residual Closeness of Graphs Under Join Operation
cites work: Link Vulnerability in Networks
cites work: On the Invulnerability of the Regular Complete k-Partite Graphs
cites work: Q4692391
cites work: Tenacity and rupture degree of permutation graphs of complete bipartite graphs
cites work: On a class of posets and the corresponding comparability graphs
cites work: Turan's Graph Theorem
cites work: Q4871072
cites work: Q3032280
cites work: Eine Extremalaufgabe aus der Graphentheorie.
cites work: Computing the Scattering Number of Graphs
cites work: Vulnerability of Mycielski graphs via residual closeness.
cites work: Q5355027
cites work: Tough graphs and Hamiltonian circuits.
cites work: Rupture degree of graphs
cites work: Residual closeness in cycles and related networks
DOI: 10.1142/S0129054123500077
description: scientific article; zbMATH DE number 7864524