Results 51 to 60 of about 590 (74)
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
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
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
On Radio Connection Number of Graphs
Discussiones Mathematicae Graph Theory, 2019 Given a graph G and a vertex coloring c, G is called l-radio connected if between any two distinct vertices u and v there is a path such that coloring c restricted to that path is an l-radio coloring.
Marinescu-Ghemeci Ruxandra
doaj +1 more source
A Sufficient Condition for Graphs to Be Super K-Restricted Edge Connected
Discussiones Mathematicae Graph Theory, 2017 For a subset S of edges in a connected graph G, S is a k-restricted edge cut if G − S is disconnected and every component of G − S has at least k vertices.
Wang Shiying, Wang Meiyu, Zhang Lei
doaj +1 more source
Connectivity Concepts in Intuitionistic Fuzzy Incidence Graphs with Application. [PDF]
Int J Appl Comput Math, 2022 Nazeer I, Rashid T.
europepmc +1 more source
Arc Fault Tolerance of Cartesian Product of Regular Digraphs on Super-Restricted Arc-Connectivity
Discussiones Mathematicae Graph Theory, 2019 Let D = (V (D),A(D)) be a strongly connected digraph. An arc set S ⊆ A(D) is a restricted arc-cut of D if D − S has a non-trivial strong component D1 such that D − V (D1) contains an arc.
Zhang Guozhen, Wang Shiying
doaj +1 more source