Spectral graph theory (Algebraic graph theory) which emerged in 1950s and 1960s is the study of properties of a graph in relationship to the characteristic polynomial, eigenvalues and eigenvectors of matrices associated to the graph. The major source of research in spectral graph theory has been the study of relationship between the structural and spectral properties of graphs. Another source has research in quantum chemistry. Just as astronomers study stellar spectra to determine the make-up of distant stars, one of the main goals in spectral graph theory is to deduce the principal properties and structure of a graph from its graph spectrum (or from a short list of easily computable invariants). The spectral approach for general graphs is ...
In this paper we give a simple characterization of the Laplacian spectra of a family of graphs as th...
AbstractThe energy of a graph G is the sum of the absolute values of the eigenvalues of the adjacenc...
AbstractLet G be a simple graph of order n, and let μ1≥μ2≥⋯≥μn=0 be the Laplacian spectrum of G. The...
Spectral graph theory (Algebraic graph theory) which emerged in 1950s and 1960s is the study of prop...
the energy of a graph is the sum of the absolute value of the eigenvalues of the adjacency matrix of...
For a graph $G$ having adjacency spectrum ($A$-spectrum) $\lambda_n\leq\lambda_{n-1}\leq\cdots\leq\l...
For a graph $G$ having adjacency spectrum ($A$-spectrum) $\lambda_n\leq\lambda_{n-1}\leq\cdots\leq\l...
For a graph $G$ having adjacency spectrum ($A$-spectrum) $\lambda_n\leq\lambda_{n-1}\leq\cdots\leq\l...
The topic of graph energy was first introduced by Ian Gutman in 1978 and arose as a problem in chemi...
Abstract. Suppose µ1, µ2,..., µn are Laplacian eigenvalues of a graph G. The Laplacian energy of G i...
Global COE Program Education-and-Research Hub for Mathematics-for-IndustryグローバルCOEプログラム「マス・フォア・インダスト...
Let $G=(V,E)$ be a simple graph of order $n$ with $m$ edges. The energy of a graph $G$, denoted by $...
AbstractLet G be a simple graph of order n, and let μ1≥μ2≥⋯≥μn=0 be the Laplacian spectrum of G. The...
AbstractLet G be a graph with n vertices and m edges. Let λ1,λ2,…,λn be the eigenvalues of the adjac...
In my thesis I deal with the notion of the graph spectrum that represents one of the tools for exami...
In this paper we give a simple characterization of the Laplacian spectra of a family of graphs as th...
AbstractThe energy of a graph G is the sum of the absolute values of the eigenvalues of the adjacenc...
AbstractLet G be a simple graph of order n, and let μ1≥μ2≥⋯≥μn=0 be the Laplacian spectrum of G. The...
Spectral graph theory (Algebraic graph theory) which emerged in 1950s and 1960s is the study of prop...
the energy of a graph is the sum of the absolute value of the eigenvalues of the adjacency matrix of...
For a graph $G$ having adjacency spectrum ($A$-spectrum) $\lambda_n\leq\lambda_{n-1}\leq\cdots\leq\l...
For a graph $G$ having adjacency spectrum ($A$-spectrum) $\lambda_n\leq\lambda_{n-1}\leq\cdots\leq\l...
For a graph $G$ having adjacency spectrum ($A$-spectrum) $\lambda_n\leq\lambda_{n-1}\leq\cdots\leq\l...
The topic of graph energy was first introduced by Ian Gutman in 1978 and arose as a problem in chemi...
Abstract. Suppose µ1, µ2,..., µn are Laplacian eigenvalues of a graph G. The Laplacian energy of G i...
Global COE Program Education-and-Research Hub for Mathematics-for-IndustryグローバルCOEプログラム「マス・フォア・インダスト...
Let $G=(V,E)$ be a simple graph of order $n$ with $m$ edges. The energy of a graph $G$, denoted by $...
AbstractLet G be a simple graph of order n, and let μ1≥μ2≥⋯≥μn=0 be the Laplacian spectrum of G. The...
AbstractLet G be a graph with n vertices and m edges. Let λ1,λ2,…,λn be the eigenvalues of the adjac...
In my thesis I deal with the notion of the graph spectrum that represents one of the tools for exami...
In this paper we give a simple characterization of the Laplacian spectra of a family of graphs as th...
AbstractThe energy of a graph G is the sum of the absolute values of the eigenvalues of the adjacenc...
AbstractLet G be a simple graph of order n, and let μ1≥μ2≥⋯≥μn=0 be the Laplacian spectrum of G. The...