Buscar
Mostrando ítems 1-3 de 3
Artículo
Superconnectivity of Networks Modeled by the Strong Product of Graphs
(University of Belgrade, 2015)
Maximal connectivity and superconnectivity in a network are two important features of its reliability. In this paper, using graph terminology, we first give a lower bound for the vertex connectivity of the strong product ...
Artículo
On the bipartite vertex frustration of graphs
(Elsevier, 2016-10)
The bipartite vertex (resp. edge) frustration of a graph G, denoted by ψ(G) (resp. φ(G)), is the smallest number of vertices (resp. edges) that have to be deleted from G to obtain a bipartite subgraph of G. A sharp lower ...
Artículo
On Generalized 3-Connectivity of the Strong Product of Graphs
(University of Belgrade, 2018)
Let G be a connected graph with n vertices and let k be an integer such that 2 k n. The generalized connectivity k(G) of G is the greatest positive integer l for which G contains at least l internally disjoint ...