Results 131 to 140 of about 42,138 (164)

On adjacency and (signless) Laplacian spectra of centralizer and co-centralizer graphs of some finite non-abelian groups

Electronic Journal of Graph Theory and Applications
Let G be a finite non-abelian group. The centralizer graph of G is a simple undirected graph Γcent(G), whose vertices are the proper centralizers of G and two vertices are adjacent if and only if their cardinalities are identical.
Jharna Kalita, Somnath Paul
doaj   +1 more source

Spectral characterizations of graphs with small spectral radius

, 2012
A graph is said to have a small spectral radius if it does not exceed the corresponding Hoffmann limit value. In the case of (signless) Laplacian matrix, the Hoffmann limit value is equal to ε+2=4.38+, with ε being the real root of x3-4x-4.
BELARDO, Francesco, Wang, Jianfeng, WANG J. F.   +2 more
core   +1 more source

Nordhaus-Gaddum Type Bounds For Laplacian And Signless Laplacian Eigenvalues Of Graphs

, 2018
Grafların Laplasyan, İşaretsiz Laplasyan matrisi ve öz değerleri matematikte ve birçok alanda büyük ölçüde kullanılmaktadır. Bir grafın ve bu grafın komplementinin graf değişmezlerinin toplamı ya da çarpımının herhangi bir alt veya üst sınırı Nordhaus ...
BAŞBUĞ, Aysun, SORGUN, Sezer
core  

Representation learning of in-degree-based digraph with rich information

Complex & Intelligent Systems
Network representation learning aims to map the relationship between network nodes and context nodes to a low-dimensional representation vector space. Directed network representation learning considers mapping directional of node vector.
Yan Sun, Cun Zhu, JianFu Chen, Kejia Lan, Jiuchang Pei   +4 more
doaj   +1 more source

On the signless Laplacian energy and signless Laplacian Estrada index of extremal graphs

Applied Mathematical Sciences, 2014
R. Binthiya, P. B. Sarasija
openaire   +1 more source

H$^+$-Eigenvalues of Laplacian and Signless Laplacian Tensors

, 2013
We propose a simple and natural definition for the Laplacian and the signless Laplacian tensors of a uniform hypergraph. We study their H$^+$-eigenvalues, i.e., H-eigenvalues with nonnegative H-eigenvectors, and H$^{++}$-eigenvalues, i.e., H-eigenvalues with positive H-eigenvectors.
openaire   +2 more sources

On the Faria's inequality for the Laplacian and signless Laplacian spectra: a unified approach

Let p(G)p(G) and q(G)q(G) be the number of pendant vertices and quasi-pendant vertices of a simple undirected graph G, respectively. Let m_L±(G)(1) be the multiplicity of 1 as eigenvalue of a matrix which can be either the Laplacian or the signless ...
Andrade, E., Rojo, O., Pastén, G., Cardoso, Domingos M.   +3 more
core   +1 more source

On Zagreb index, signless Laplacian eigenvalues and signless Laplacian energy of a graph

Computational and Applied Mathematics, 2023
13
Shariefuddin Pirzada, Saleem Khan
exaly   +4 more sources

The signless Laplacian and distance signless Laplacian spectral radius of digraphs with some given parameters

Discrete Applied Mathematics, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ligong Wang, Weige Xi
exaly   +2 more sources

On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph [PDF]

Czechoslovak Mathematical Journal, 2013
The authors prove a number of formulas on the characteristic polynomials of the Laplacian, signless Laplacian and normalized Laplacian matrices of graphs. The use of these formulas is exemplified in constructions of graphs cospectral with respect to the appropriate matrix.
Jianxi Li, Ji-Ming Guo, Wai-Chee Shiu
exaly   +2 more sources