Results 21 to 30 of about 306 (150)
Spanning trees and signless Laplacian spectral radius in graphs [PDF]
12 ...
Sufang Wang, Wei Zhang
openalex +3 more sources
The signless Laplacian spectral radius of subgraphs of regular graphs [PDF]
, 2016 Let $q(H)$ be the signless Laplacian spectral radius of a graph $H$. In this paper, we prove that \\1. Let $H$ be a proper subgraph of a $ $-regular graph $G$ with $n$ vertices and diameter $D$. Then $$2 - q(H)>\frac{1}{n(D-\frac{1}{4})}.$$ \\2. Let $H$ be a proper subgraph of a $k$-connected $ $-regular graph $G$ with $n$ vertices, where $k\geq ...
Qi Kong, Ligong Wang
openalex +3 more sources
The (signless Laplacian) spectral radius (of subgraphs) of uniform hypergraphs
Filomat, 2019 Let ?1(G) and q1(G) be the spectral radius and the signless Laplacian spectral radius of a kuniform hypergraph G, respectively. In this paper, we give the lower bounds of d-?1(H) and 2d-q1(H), where H is a proper subgraph of a f (-edge)-connected d-regular (linear) k-uniform hypergraph.
Cunxiang Duan +3 more
openalex +3 more sources
The smallest spectral radius of graphs with a given clique number. [PDF]
ScientificWorldJournal, 2014 The first four smallest values of the spectral radius among all connected graphs with maximum clique size ω ≥ 2 are obtained.
Zhang JM, Huang TZ, Guo JM.
europepmc +2 more sources
The Signless Laplacian Spectral Radius of Some Special Bipartite Graphs
Journal of Applied Mathematics and Physics, 2018 This paper mainly researches on the signless laplacian spectral radius of bipartite graphs Dr(m1,m2;n1,n2). We consider how the signless laplacian spectral radius of Dr(m1,m2;n1,n2) changes under some special cases. As application, we give two upper bounds on the signless laplacian spectral radius of Dr(m1,m2;n1,n2), and determine the graphs that ...
Yun Yang
openalex +3 more sources
European Journal of Pure and Applied MathematicsA Generalized core-satellite graph Θ(c, S, η∗) belongs to the family of graphs of diameter two. It has a central core of nodes connected to a few satellites, where all satellite cliques are not identical and might be of different sizes. These graphs can be used to model any real-world complex network.
V Malathy, Kalyani Desikan
openalex +3 more sources
Maximizing the signless Laplacian spectral radius of some theta graphs [PDF]
Let $Q(G)=D(G)+A(G)$ be the signless Laplacian matrix of a simple graph $G$, where $D(G)$ and $A(G)$ are the degree diagonal matrix and the adjacency matrix of $G$, respectively. The largest eigenvalue of $Q(G)$, denoted by $q(G)$, is called the signless Laplacian spectral radius of $G$.
Yuxiang Liu, Ligong Wang
openalex +3 more sources
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
Sufficient Conditions for Graphs to Be k‐Connected, Maximally Connected, and Super‐Connected
Complexity, 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
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