Results 41 to 50 of about 567 (69)
On Conditional Connectivity of the Cartesian Product of Cycles
Discussiones Mathematicae Graph Theory, 2023 The conditional h-vertex (h-edge) connectivity of a connected graph H of minimum degree k > h is the size of a smallest vertex (edge) set F of H such that H − F is a disconnected graph of minimum degree at least h. Let G be the Cartesian product of r ≥ 1
Saraf J.B., Borse Y.M., Mundhe Ganesh
doaj +1 more source
Fixed Points for Banach and Kannan Contractions in Modular Spaces with a Graph [PDF]
, 2013 In this paper, we discuss the existence and uniqueness of fixed points for Banach and Kannan $\widetilde G$-$\rho$-contractions defined on modular spaces endowed with a graph without using the $\Delta_2$-condition or the Fatou property.Comment: 12 ...
Aghanians, Aris, Nourouzi, Kourosh
core
Under which conditions is λ″(G)=κ″(L(G))?
AKCE International Journal of Graphs and Combinatorics, 2023 In this paper we show that if G is a connected graph such that [Formula: see text], [Formula: see text] and [Formula: see text] then [Formula: see text] exists and [Formula: see text] if and only if G is not super-[Formula: see text]. We also obtain some
Farnaz Soliemany +2 more
doaj +1 more source
Characterizing Atoms that Result from Decomposition by Clique Separators
Discussiones Mathematicae Graph Theory, 2017 A graph is defined to be an atom if no minimal vertex separator induces a complete subgraph; thus, atoms are the graphs that are immune to clique separator decomposition.
McKee Terry A.
doaj +1 more source
The generalized 3-connectivity of burnt pancake graphs and godan graphs
AKCE International Journal of Graphs and Combinatorics, 2023 The generalized k-connectivity of a graph G, denoted by [Formula: see text] is the minimum number of internally edge disjoint S-trees for any [Formula: see text] and [Formula: see text] The generalized k-connectivity is a natural extension of the ...
Jing Wang, Zuozheng Zhang, Yuanqiu Huang
doaj +1 more source
The Double Roman Domatic Number of a Digraph
Discussiones Mathematicae Graph Theory, 2020 A double Roman dominating function on a digraph D with vertex set V (D) is defined in [G. Hao, X. Chen and L. Volkmann, Double Roman domination in digraphs, Bull. Malays. Math. Sci. Soc. (2017).] as a function f : V (D) → {0, 1, 2, 3} having the property
Volkmann Lutz
doaj +1 more source
On minimum algebraic connectivity of graphs whose complements are bicyclic
Open Mathematics, 2019 The second smallest eigenvalue of the Laplacian matrix of a graph (network) is called its algebraic connectivity which is used to diagnose Alzheimer’s disease, distinguish the group differences, measure the robustness, construct multiplex model ...
Liu Jia-Bao +3 more
doaj +1 more source
Rainbow Vertex-Connection and Forbidden Subgraphs
Discussiones Mathematicae Graph Theory, 2018 A path in a vertex-colored graph is called vertex-rainbow if its internal vertices have pairwise distinct colors. A vertex-colored graph G is rainbow vertex-connected if for any two distinct vertices of G, there is a vertex-rainbow path connecting them ...
Li Wenjing, Li Xueliang, Zhang Jingshu
doaj +1 more source
Decomposition of the Product of Cycles Based on Degree Partition
Discussiones Mathematicae Graph Theory, 2019 The Cartesian product of n cycles is a 2n-regular, 2n-connected and bi- pancyclic graph. Let G be the Cartesian product of n even cycles and let 2n = n1+ n2+ ・ ・ ・ + nkwith k ≥ 2 and ni≥ 2 for each i. We prove that if k = 2, then G can be decomposed into
Borse Y. M., Shaikh S. R.
doaj +1 more source
Controllability of a swarm of topologically interacting autonomous agents
, 2014 Controllability of complex networks has been the focal point of many recent studies in the field of complexity. These landmark advances shed a new light on the dynamics of natural and technological complex systems. Here, we analyze the controllability of
Bouffanais, Roland, Komareji, Mohammad
core