Results 31 to 40 of about 2,494 (128)
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
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
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
Degree Subtraction Adjacency Eigenvalues and Energy of Graphs Obtained From Regular Graphs
Open Journal of Discrete Applied Mathematics, 2018 Let V (G) = {v1, v2, . . . , vn} be the vertex set of G and let dG(vi) be the degree of a vertex vi in G. The degree subtraction adjacency matrix of G is a square matrix DSA(G) = [dij ], in which dij = dG(vi) − dG(vj), if vi is adjacent to vj and dij = 0,
H. Ramane, Hemaraddi N. Maraddi
semanticscholar +1 more source
Rank relations between a {0, 1}-matrix and its complement
Open Mathematics, 2018 Let A be a {0, 1}-matrix and r(A) denotes its rank. The complement matrix of A is defined and denoted by Ac = J − A, where J is the matrix with each entry being 1.
Ma Chao, Zhong Jin
doaj +1 more source
Some inequalities on the skew-spectral radii of oriented graphs
, 2012 Let G be a simple graph and Gσ be an oriented graph obtained from G by assigning a direction to each edge of G. The adjacency matrix of G is A(G) and the skew-adjacency matrix of Gσ is S(Gσ).
Guang-Hui Xu
semanticscholar +1 more source
On First Hermitian-Zagreb Matrix and Hermitian-Zagreb Energy
International Journal of Scientific Research in Mathematical and Statistical Sciences, 2018 A mixed graph is a graph with edges and arcs, which can be considered as a combination of an undirected graph and a directed graph. In this paper we propose a Hermitian matrix for mixed graphs which is a modified version of the classical adjacency matrix
A. Bharali
semanticscholar +1 more source