Results 21 to 30 of about 2,530 (150)
Bounds on normalized Laplacian eigenvalues of graphs
, 2014 Let G be a simple connected graph of order n, where n≥2. Its normalized Laplacian eigenvalues are 0=λ1≤λ2≤⋯≤λn≤2. In this paper, some new upper and lower bounds on λn are obtained, respectively.
Jianxi Li, Ji-Ming Guo, W. Shiu
semanticscholar +1 more source
Fractional Revival of Threshold Graphs Under Laplacian Dynamics
Discussiones Mathematicae Graph Theory, 2020 We consider Laplacian fractional revival between two vertices of a graph X. Assume that it occurs at time τ between vertices 1 and 2. We prove that for the spectral decomposition L=∑r=0qθrErL = \sum\nolimits_{r = 0}^q {{\theta _r}{E_r}} of the Laplacian
Kirkland Steve, Zhang Xiaohong
doaj +1 more source
On real or integral skew Laplacian spectrum of digraphs
, 2020 For a simple connected graph G with n vertices and m edges, let −→ G be a digraph obtained by giving an arbitrary direction to the edges of G . In this paper, we consider the skew Laplacian matrix of a digraph −→ G and we obtain the skew Laplacian ...
S. Pirzada +2 more
semanticscholar +1 more source
Characteristic polynomials of some weighted graph bundles and its application to links
International Journal of Mathematics and Mathematical Sciences, Volume 17, Issue 3, Page 503-510, 1994., 1994 In this paper, we introduce weighted graph bundles and study their characteristic polynomial. In particular, we show that the characteristic polynomial of a weighted ‐bundles over a weighted graph G? can be expressed as a product of characteristic polynomials two weighted graphs whose underlying graphs are G As an application, we compute the signature ...
Moo Young Sohn, Jaeun Lee
wiley +1 more source
Inertias of Laplacian matrices of weighted signed graphs
Special Matrices, 2019 We study the sets of inertias achieved by Laplacian matrices of weighted signed graphs. First we characterize signed graphs with a unique Laplacian inertia.
Monfared K. Hassani +3 more
doaj +1 more source
On minimum algebraic connectivity of graphs whose complements are bicyclic
Open Mathematics, 2019 The second smallest eigenvalue of the Laplacian matrix of a graph (network) is called its algebraic connectivity which is used to diagnose Alzheimer’s disease, distinguish the group differences, measure the robustness, construct multiplex model ...
Liu Jia-Bao +3 more
doaj +1 more source
On the Skew Spectra of Cartesian Products of Graphs
Electronic Journal of Combinatorics, 2013 An oriented graph G is a simple undirected graph G with an orientation σ, which assigns to each edge of G a direction so that G becomes a directed graph.
Denglan Cui, Yaoping Hou
semanticscholar +1 more source
A note on distance spectral radius of trees
Special Matrices, 2017 The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. We determine the unique non-starlike non-caterpillar tree with maximal distance spectral radius.
Wang Yanna +3 more
doaj +1 more source
Small clique number graphs with three trivial critical ideals
Special Matrices, 2018 The critical ideals of a graph are the determinantal ideals of the generalized Laplacian matrix associated to a graph. Previously, they have been used in the understanding and characterizing of the graphs with critical group with few invariant factors ...
Alfaro Carlos A., Valencia Carlos E.
doaj +1 more source
Enumeration of spanning trees in the sequence of Dürer graphs
Open Mathematics, 2017 In this paper, we calculate the number of spanning trees in the sequence of Dürer graphs with a special feature that it has two alternate states. Using the electrically equivalent transformations, we obtain the weights of corresponding equivalent graphs ...
Li Shixing
doaj +1 more source