Do you want to publish a course? Click here

On the symmetry of the Laplacian spectra of signed graphs

172   0   0.0 ( 0 )
 Added by Fatihcan M. Atay
 Publication date 2014
  fields
and research's language is English




Ask ChatGPT about the research

We study the symmetry properties of the spectra of normalized Laplacians on signed graphs. We find a new machinery that generates symmetric spectra for signed graphs, which includes bipartiteness of unsigned graphs as a special case. Moreover, we prove a fundamental connection between the symmetry of the spectrum and the existence of damped two-periodic solutions for the discrete-time heat equation on the graph.



rate research

Read More

We study the Laplacian spectrum of token graphs, also called symmetric powers of graphs. The $k$-token graph $F_k(G)$ of a graph $G$ is the graph whose vertices are the $k$-subsets of vertices from $G$, two of which being adjacent whenever their symmetric difference is a pair of adjacent vertices in $G$. In this paper, we give a relationship between the Laplacian spectra of any two token graphs of a given graph. In particular, we show that, for any integers $h$ and $k$ such that $1le hle kle frac{n}{2}$, the Laplacian spectrum of $F_h(G)$ is contained in the Laplacian spectrum of $F_k(G)$. We also show that the double odd graphs and doubled Johnson graphs can be obtained as token graphs of the complete graph $K_n$ and the star $S_{n}=K_{1,n-1}$, respectively. Besides, we obtain a relationship between the spectra of the $k$-token graph of $G$ and the $k$-token graph of its complement $overline{G}$. This generalizes a well-known property for Laplacian eigenvalues of graphs to token graphs. Finally, the double odd graphs and doubled Johnson graphs provide two infinite families, together with some others, in which the algebraic connectivities of the original graph and its token graph coincide. Moreover, we conjecture that this is the case for any graph $G$ and its token graph.
185 - Leonid Golinskii 2019
Given two graphs, a backbone and a finger, a comb product is a new graph obtained by grafting a copy of the finger into each vertex of the backbone. We study the comb graphs in the case when both components are the paths of order $n$ and $k$, respectively, as well as the above comb graphs with an infinite ray attached to some of their vertices. A detailed spectral analysis is carried out in both situations.
304 - Leonid Golinskii 2020
Two method for computation of the spectra of certain infinite graphs are suggested. The first one can be viewed as a reversed Gram--Schmidt orthogonalization procedure. It relies heavily on the spectral theory of Jacobi matrices. The second method is related to the Schur complement for block matrices. A number of examples including infinite graphs with tails, chains of cycles and ladders are worked out in detail.
We investigate multiplicity and symmetry properties of higher eigenvalues and eigenfunctions of the $p$-Laplacian under homogeneous Dirichlet boundary conditions on certain symmetric domains $Omega subset mathbb{R}^N$. By means of topological arguments, we show how symmetries of $Omega$ help to construct subsets of $W_0^{1,p}(Omega)$ with suitably high Krasnoselskiu{i} genus. In particular, if $Omega$ is a ball $B subset mathbb{R}^N$, we obtain the following chain of inequalities: $$ lambda_2(p;B) leq dots leq lambda_{N+1}(p;B) leq lambda_ominus(p;B). $$ Here $lambda_i(p;B)$ are variational eigenvalues of the $p$-Laplacian on $B$, and $lambda_ominus(p;B)$ is the eigenvalue which has an associated eigenfunction whose nodal set is an equatorial section of $B$. If $lambda_2(p;B)=lambda_ominus(p;B)$, as it holds true for $p=2$, the result implies that the multiplicity of the second eigenvalue is at least $N$. In the case $N=2$, we can deduce that any third eigenfunction of the $p$-Laplacian on a disc is nonradial. The case of other symmetric domains and the limit cases $p=1$, $p=infty$ are also considered.
We show that the deficiency indices of the minimal Gaffney Laplacian on an infinite locally finite metric graph are equal to the number of finite volume graph ends. Moreover, we provide criteria, formulated in terms of finite volume graph ends, for the Gaffney Laplacian to be closed.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا