Results 71 to 80 of about 960 (155)
Some Results on the Signless Laplacian Spectra of Unicyclic Graphs
International Scholarly Research Notices, Volume 2011, Issue 1, 2011., 2011 We determine the second to fourth largest (resp. the second smallest) signless Laplacian spectral radii and the second to fourth largest signless Laplacian spreads together with the corresponding graphs in the class of unicyclic graphs with n vertices.
Muhuo Liu, M. Asaad, P. Koshlukov
wiley +1 more source
Spectra of general hypergraphs
, 2017 Here, we show a method to reconstruct connectivity hypermatrices of a general hypergraph (without any self loop or multiple edge) using tensor. We also study the different spectral properties of these hypermatrices and find that these properties are ...
Banerjee, Anirban +2 more
core +1 more source
The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
, 2014 Let $G$ be a connected non-bipartite graph on $n$ vertices with domination number $\gamma \le \frac{n+1}{3}$. We investigate the least eigenvalue of the signless Laplacian of $G$, and present a lower bound for such eigenvalue in terms of the domination ...
Fan, Yi-Zheng, Tan, Ying-Ying
core +1 more source
The Largest Laplacian and Signless Laplacian H-Eigenvalues of a Uniform Hypergraph [PDF]
, 2013 In this paper, we show that the largest Laplacian H-eigenvalue of a $k$-uniform nontrivial hypergraph is strictly larger than the maximum degree when $k$ is even. A tight lower bound for this eigenvalue is given.
Hu, Shenglong, Qi, Liqun, Xie, Jinshan
core
Maxima of the Q-index: forbidden 4-cycle and 5-cycle [PDF]
, 2013 This paper gives tight upper bounds on the largest eigenvalue q(G) of the signless Laplacian of graphs with no 4-cycle and no 5-cycle. If n is odd, let F_{n} be the friendship graph of order n; if n is even, let F_{n} be F_{n-1} with an edge hanged to ...
de Freitas, Maria Aguieiras A. +2 more
core
Perturbation of the α-spectral radius of complete multipartite graphs
上海师范大学学报. 自然科学版Let G be a graph and α∈[0, 1), Nikiforov merged the adjacency matrix and the signless Laplacian matrix to Aα(G)=αD(G)+(1-α)A(G), where D(G), A(G) are the degree diagonal matrix and the adjacency matrix of G, respectively.
WU Yuhao +3 more
doaj +1 more source
IEEE AccessExploring the applications of Laplacian and signless Laplacian spectra extends beyond theoretical chemistry, computer science, electrical networks, and complex networks.
Ali Raza +3 more
doaj +1 more source
Laplacian spectra and structural insights: applications in chemistry and network science
Frontiers in Applied Mathematics and StatisticsThis paper presents the practical applications of Laplacian and signless Laplacian spectra across various fields including theoretical chemistry, computer science, electrical engineering, and complex network analysis.
Ali Raza, Muhammad Mobeen Munir
doaj +1 more source
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 +1 more source
Signless Laplacian spectral radius and fractional matchings in graphs
, 2019 A fractional matching of a graph $G$ is a function $f$ giving each edge a number in $[0,1]$ such that $\sum_{e\in (v)}f(e)\leq1$ for each vertex $v\in V(G)$, where $ (v)$ is the set of edges incident to $v$. The fractional matching number of $G$, written $ ^{\prime}_*(G)$, is the maximum value of $\sum_{e\in E(G)}f(e)$ over all fractional matchings.
Pan, Yingui, Li, Jianping
openaire +2 more sources