Results 91 to 100 of about 960 (155)

A Note on the Spectral Radius of Weighted Signless Laplacian Matrix

open access: yesAdvances in Linear Algebra & Matrix Theory, 2018
A weighted graph is a graph that has a numeric label associated with each edge, called the weight of edge. In many applications, the edge weights are usually represented by nonnegative integers or square matrices. The weighted signless Laplacian matrix of a weighted graph is defined as the sum of adjacency matrix and degree matrix of same weighted ...
KAYA GÖK, GÜLİSTAN   +2 more
openaire   +3 more sources

Bounds on Spectral Radius and Signless Laplacian Spectral Radius for Generalized Core-satellite Graphs

open access: yesEuropean Journal of Pure and Applied Mathematics
A 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.
Malathy V, Kalyani Desikan
openaire   +1 more source

Maxima of the signless Laplacian spectral radius for planar graphs

open access: yes, 2014
The signless Laplacian spectral radius of a graph is the largest eigenvalue of its signless Laplacian. In this paper, we prove that the graph $K_{2}\nabla P_{n-2}$ has the maximal signless Laplacian spectral radius among all planar graphs of order $n\geq 456$.
openaire   +2 more sources

The Signless Laplacian Spectral Radius of Some Special Bipartite Graphs

open access: yesJournal 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 ...
openaire   +2 more sources

Home - About - Disclaimer - Privacy