Results 11 to 20 of about 121 (97)
On distance signless Laplacian spectral radius of power graphs of cyclic and dihedral groups [PDF]
Annales Mathematicae et Informaticae, 2022 Summary: For a finite group \(\mathcal{G}\), the power graph \(\mathcal{P}(\mathcal{G})\) is a connected simple graph, whose vertex set is the set of elements of \(\mathcal{G}\) and two vertices are connected by an edge if and only if one is the power of the other.
Shaban, Rezwan Ul +3 more
core +7 more sources
Characterizing an odd [1, b]-factor on the distance signless Laplacian spectral radius
RAIRO - Operations Research, 2023 LetGbe a connected graph of even ordern. An odd [1, b]-factor ofGis a spanning subgraphFofGsuch thatdF(v) ∈ {1, 3, 5, ⋯,b} for anyv ∈ V(G), wherebis positive odd integer. The distance matrixƊ(G) ofGis a symmetric real matrix with (i, j)-entry being the distance between the verticesviandvj. The distance signless Laplacian matrixQ(G) ofGis defined byQ(G),
Sizhong Zhou, Hongxia Liu
openaire +2 more sources
k路覆盖图的新充分条件(New sufficient conditions on k -path-coverable graphs)
Zhejiang Daxue xuebao. Lixue ban, 2019 Let G be a simple connected graph of order n. A graph G is k-path-coverable if its vertex set V ( G ) can be covered by kor fewer vertex-disjoint paths. In this paper, we give some new sufficient conditions for a graph to be k-path-coverable in terms of ...
JIAHuicai(贾会才)
doaj +2 more sources
Distance (signless) Laplacian spectral radius of uniform hypergraphs
Linear Algebra and its Applications, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hongying Lin, Bo Zhou, Yanna Wang
openaire +3 more sources
Spectral and Sharp Sufficient Conditions for Graphs to Admit a Strong Star Factor
MathematicsLetGbe a graph. An odd [1,k]-factor of a graph G is a spanning subgraph H of G such that degH(v) is odd and 1⩽degH(v)⩽k for every v∈V(G) where k is a positive odd integer. We call a spanning subgraph H of a graph G a strong star factor if every component
Fengyun Ren, Shumin Zhang, He Li
doaj +2 more sources
Linear Algebra and its Applications, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luis Medina, Macarena Trigo
openaire +3 more sources
On Extremal Spectral Radii of Uniform Supertrees with Given Independence Number
Discrete Dynamics in Nature and Society, Volume 2022, Issue 1, 2022., 2022 A supertree is a connected and acyclic hypergraph. Denote by Tm,n,α the set of m‐uniform supertrees of order n with independent number α. Focusing on the spectral radius in Tm,n,α, this present completely determines the hypergraphs with maximum spectral radius among all the supertrees with n vertices and independence number α for [m − 1/mn] ≤ α ≤ n − 1,
Lei Zhang +2 more
wiley +1 more source
New Bounds for the Generalized Distance Spectral Radius/Energy of Graphs
Mathematical Problems in Engineering, Volume 2022, Issue 1, 2022., 2022 Let G be a simple connected graph with vertex set V(G) = {v1, v2, …, vn} and dvi be the degree of the vertex vi. Let D(G) be the distance matrix and Tr(G) be the diagonal matrix of the vertex transmissions of G. The generalized distance matrix of G is defined as Dα(G) = αTr(G) + (1 − α)D(G), where 0 ≤ α ≤ 1. If λ1, λ2, …, λn are the eigenvalues of Dα(G)
Yuzheng Ma +3 more
wiley +1 more source
Hamilton Connectivity of Convex Polytopes with Applications to Their Detour Index
Complexity, Volume 2021, Issue 1, 2021., 2021 A connected graph is called Hamilton‐connected if there exists a Hamiltonian path between any pair of its vertices. Determining whether a graph is Hamilton‐connected is an NP‐complete problem. Hamiltonian and Hamilton‐connected graphs have diverse applications in computer science and electrical engineering.
Sakander Hayat +4 more
wiley +1 more source
Some Chemistry Indices of Clique‐Inserted Graph of a Strongly Regular Graph
Complexity, Volume 2021, Issue 1, 2021., 2021 In this paper, we give the relation between the spectrum of strongly regular graph and its clique‐inserted graph. The Laplacian spectrum and the signless Laplacian spectrum of clique‐inserted graph of strongly regular graph are calculated. We also give formulae expressing the energy, Kirchoff index, and the number of spanning trees of clique‐inserted ...
Chun-Li Kan +4 more
wiley +1 more source