Laplacian spectral characterization of roses
نویسندگان
چکیده
منابع مشابه
The Signless Laplacian Spectral Characterization of Strongly Connected Bicyclic Digraphs
Let −→ G be a digraph and A( −→ G) be the adjacency matrix of −→ G . Let D( −→ G) be the diagonal matrix with outdegrees of vertices of −→ G and Q( −→ G) = D( −→ G) + A( −→ G) be the signless Laplacian matrix of −→ G . The spectral radius of Q( −→ G) is called the signless Laplacian spectral radius of −→ G . In this paper, we determine the unique digraph which attains the maximum (or minimum) s...
متن کاملSpectral Characterization of Graphs with Small Second Largest Laplacian Eigenvalue
The family G of connected graphs with second largest Laplacian eigenvalue at most θ, where θ = 3.2470 is the largest root of the equation μ−5μ+6μ−1 = 0, is characterized by Wu, Yu and Shu [Y.R. Wu, G.L. Yu and J.L. Shu, Graphs with small second largest Laplacian eigenvalue, European J. Combin. 36 (2014) 190–197]. Let G(a, b, c, d) be a graph with order n = 2a + b + 2c + 3d + 1 that consists of ...
متن کاملA Relative Laplacian Spectral Recursion
The Laplacian spectral recursion, satisfied by matroid complexes and shifted complexes, expresses the eigenvalues of the combinatorial Laplacian of a simplicial complex in terms of its deletion and contraction with respect to vertex e, and the relative simplicial pair of the deletion modulo the contraction. We generalize this recursion to relative simplicial pairs, which we interpret as convex ...
متن کاملSpectral Stability of the Neumann Laplacian
We prove the equivalence of Hardyand Sobolev-type inequalities, certain uniform bounds on the heat kernel and some spectral regularity properties of the Neumann Laplacian associated with an arbitrary region of finite measure in Euclidean space. We also prove that if one perturbs the boundary of the region within a uniform Hölder category then the eigenvalues of the Neumann Laplacian change by a...
متن کاملSIGNLESS LAPLACIAN SPECTRAL MOMENTS OF GRAPHS AND ORDERING SOME GRAPHS WITH RESPECT TO THEM
Let $G = (V, E)$ be a simple graph. Denote by $D(G)$ the diagonal matrix $diag(d_1,cdots,d_n)$, where $d_i$ is the degree of vertex $i$ and $A(G)$ the adjacency matrix of $G$. The signless Laplacianmatrix of $G$ is $Q(G) = D(G) + A(G)$ and the $k-$th signless Laplacian spectral moment of graph $G$ is defined as $T_k(G)=sum_{i=1}^{n}q_i^{k}$, $kgeqslant 0$, where $q_1$,$q_2$, $cdots$, $q_n$ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2018
ISSN: 0024-3795
DOI: 10.1016/j.laa.2017.08.012