Results 31 to 40 of about 470 (69)
Generalized 4-connectivity of hierarchical star networks
Open Mathematics, 2022 The connectivity is an important measurement for the fault-tolerance of a network. The generalized connectivity is a natural generalization of the classical connectivity. An SS-tree of a connected graph GG is a tree T=(V′,E′)T=\left(V^{\prime} ,E^{\prime}
Wang Junzhen, Zou Jinyu, Zhang Shumin
doaj +1 more source
On the smallest eigenvalues of the line graphs of some trees
, 2014 In this paper, we study the characteristic polynomials of the line graphs of generalized Bethe trees. We give an infinite family of such graphs sharing the same smallest eigenvalue.
Munemasa, Akihiro +2 more
core +1 more source
Weak Total Resolvability In Graphs
Discussiones Mathematicae Graph Theory, 2016 A vertex v ∈ V (G) is said to distinguish two vertices x, y ∈ V (G) of a graph G if the distance from v to x is di erent from the distance from v to y.
Casel Katrin +3 more
doaj +1 more source
Integral Laplacian graphs with a unique repeated Laplacian eigenvalue, I
Special Matrices, 2023 The set Si,n={0,1,2,…,n−1,n}\{i}{S}_{i,n}=\left\{0,1,2,\ldots ,n-1,n\right\}\setminus \left\{i\right\}, 1⩽i⩽n1\leqslant i\leqslant n, is called Laplacian realizable if there exists an undirected simple graph whose Laplacian spectrum is Si,n{S}_{i,n}. The
Hameed Abdul, Tyaglov Mikhail
doaj +1 more source
On Grundy Total Domination Number in Product Graphs
Discussiones Mathematicae Graph Theory, 2021 A longest sequence (v1, . . ., vk) of vertices of a graph G is a Grundy total dominating sequence of G if for all i, N(υj)\∪j=1i-1N(υj)≠∅N({\upsilon _j})\backslash \bigcup\nolimits_{j = 1}^{i - 1} {N({\upsilon _j})} \ne \emptyset .
Brešar Boštjan +8 more
doaj +1 more source
Journal of Mathematics, Volume 2026, Issue 1, 2026.Among various graph products, the corona product continues to inspire novel research. Subdivision graphs play a key role in understanding graph behaviour under edge modifications. The estimation of Wiener index under various graph operations is of considerable importance and has attracted substantial attention in chemical graph theory.
Vimal M. +4 more
wiley +1 more source
A Note on the Thue Chromatic Number of Lexicographic Products of Graphs
Discussiones Mathematicae Graph Theory, 2018 A sequence is called non-repetitive if none of its subsequences forms a repetition (a sequence r1r2⋯r2n such that ri = rn+i for all 1 ≤ i ≤ n). Let G be a graph whose vertices are coloured.
Peterin Iztok +3 more
doaj +1 more source
On Well-Covered Direct Products
Discussiones Mathematicae Graph Theory, 2022 A graph G is well-covered if all maximal independent sets of G have the same cardinality. In 1992 Topp and Volkmann investigated the structure of well-covered graphs that have nontrivial factorizations with respect to some of the standard graph products.
Kuenzel Kirsti, Rall Douglas F.
doaj +1 more source
Computational and Mathematical Methods, Volume 2025, Issue 1, 2025.The generalized Mycielskian graphs are known for their advantageous properties employed in interconnection networks in parallel computing to provide efficient and optimized network solutions. This paper focuses on investigating the bounds and computation of the harmonic–arithmetic index of the generalized Mycielskian graph of path graph, cycle graph ...
Pooja Danushri Namidass +2 more
wiley +1 more source
Cyclic Cordial Labeling for the Lemniscate Graphs and Their Second Powers
Journal of Mathematics, Volume 2025, Issue 1, 2025.A lemniscate graph, usually denoted by Ln,m, is defined as a union of two cycles Cn and Cm that share a common vertex. A simple graph is called cyclic group cordial if we can provide a three elements’ cyclic group labeling satisfying certain conditions.
M. A. AbdAllah +4 more
wiley +1 more source