Results 31 to 40 of about 1,309,008 (158)

Spectral properties of the commuting graphs of certain groups

open access: yesAKCE International Journal of Graphs and Combinatorics, 2019
Let G be a finite group. The commuting graph Γ=C(G)is a simple graph with vertex set G and two vertices are adjacent if and only if they commute with each other.
M. Torktaz, A.R. Ashrafi
doaj   +2 more sources

On Extremal Spectral Radii of Uniform Supertrees with Given Independence Number

open access: yesDiscrete 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

Two Kinds of Laplacian Spectra and Degree Kirchhoff Index of the Weighted Corona Networks

open access: yesJournal of Mathematics, Volume 2022, Issue 1, 2022., 2022
Recently, the study related to network has aroused wide attention of the scientific community. Many problems can be usefully represented by corona graphs or networks. Meanwhile, the weight is a vital factor in characterizing some properties of real networks.
Haiqin Liu, Yanling Shao, Azhar Hussain
wiley   +1 more source

New Bounds for the Generalized Distance Spectral Radius/Energy of Graphs

open access: yesMathematical 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

Locating Eigenvalues of a Symmetric Matrix whose Graph is Unicyclic

open access: yesTrends in Computational and Applied Mathematics, 2021
We present a linear-time algorithm that computes in a given real interval the number of eigenvalues of any symmetric matrix whose underlying graph is unicyclic.
R. O. Braga   +2 more
doaj   +1 more source

On Laplacian Equienergetic Signed Graphs

open access: yesJournal of Mathematics, Volume 2021, Issue 1, 2021., 2021
The Laplacian energy of a signed graph is defined as the sum of the distance of its Laplacian eigenvalues from its average degree. Two signed graphs of the same order are said to be Laplacian equienergetic if their Laplacian energies are equal. In this paper, we present several infinite families of Laplacian equienergetic signed graphs.
Qingyun Tao, Lixin Tao, Yongqiang Fu
wiley   +1 more source

Sufficient Conditions for Graphs to Be k‐Connected, Maximally Connected, and Super‐Connected

open access: yesComplexity, Volume 2021, Issue 1, 2021., 2021
Let G be a connected graph with minimum degree δ(G) and vertex‐connectivity κ(G). The graph G is k‐connected if κ(G) ≥ k, maximally connected if κ(G) = δ(G), and super‐connected if every minimum vertex‐cut isolates a vertex of minimum degree. In this paper, we present sufficient conditions for a graph with given minimum degree to be k‐connected ...
Zhen-Mu Hong   +4 more
wiley   +1 more source

Nilpotent Graph

open access: yesTheory and Applications of Graphs, 2021
In this article, we introduce the concept of nilpotent graph of a finite commutative ring. The set of all non nilpotent elements of a ring is taken as the vertex set and two vertices are adjacent if and only if their sum is nilpotent.
Dhiren Basnet, Ajay Sharma, Rahul Dutta
doaj   +1 more source

Hamilton Connectivity of Convex Polytopes with Applications to Their Detour Index

open access: yesComplexity, 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

The spectrum and the signless Laplacian spectrum of coronae

open access: yesLinear Algebra and its Applications, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cui, Shu-Yu, Tian, Gui-Xian
openaire   +2 more sources

Home - About - Disclaimer - Privacy