نتایج جستجو برای: seidel signless laplacian energy
تعداد نتایج: 679796 فیلتر نتایج به سال:
Let G be a weighted graph with Laplacian matrix L and signless Laplacian matrix Q. In this note, block representations for the group inverse of L and Q are given. The resistance distance in a graph can be obtained from the block representation of the group inverse of L.
Several inequalities on vertex degrees, eigenvalues, Laplacian eigen-values, and signless Laplacian eigenvalues of graphs are presented in this note. Some of them are generalizations of the inequalities in [2]. We consider only finite undirected graphs without loops or multiple edges. Notation and terminology not defined here follow that in [1]. We use [n] to denote the set of { 1, 2, ..., n}. ...
In this paper, we study the signless Laplacian spectral radius of unicyclic graphs with prescribed number of pendant vertices or independence number. We also characterize the extremal graphs completely.
The signless Laplacian Q and edge-Laplacian S of a given graph may or not be invertible. Moore-Penrose inverses are studied. In particular, using the incidence matrix, we find combinatorial formulas for trees. Also, present odd unicyclic graphs.
Let B(n, g) be the class of bicyclic graphs on n vertices with girth g. In this paper, the graphs in B(n, g) with the largest signless Laplacian spectral radius are characterized.
In this paper, we investigate how the smallest signless Laplacian eigenvalue of a graph behaves when the graph is perturbed by deleting a vertex, subdividing edges or moving edges.
Article history: Received 7 February 2013 Accepted 15 October 2013 Available online 4 November 2013 Submitted by S. Kirkland
Let B(n, g) be the class of bicyclic graphs on n vertices with girth g. In this paper, the graphs in B(n, g) with the largest signless Laplacian spectral radius are characterized.
for a simple digraph $g$ of order $n$ with vertex set${v_1,v_2,ldots, v_n}$, let $d_i^+$ and $d_i^-$ denote theout-degree and in-degree of a vertex $v_i$ in $g$, respectively. let$d^+(g)=diag(d_1^+,d_2^+,ldots,d_n^+)$ and$d^-(g)=diag(d_1^-,d_2^-,ldots,d_n^-)$. in this paper we introduce$widetilde{sl}(g)=widetilde{d}(g)-s(g)$ to be a new kind of skewlaplacian matrix of $g$, where $widetilde{d}(g...
The eccentricity of a vertex is the maximum distance from it to another vertex and the average eccentricity ecc (G) of a graph G is the mean value of eccentricities of all vertices of G. The harmonic index H (G) of a graph G is defined as the sum of 2 di+dj over all edges vivj of G, where di denotes the degree of a vertex vi in G. In this paper, we determine the unique tree with minimum average...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید