Add to ORKG[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=Drexel&SrcApp=hagerty_opac&KeyRecord=0020-7608&DestApp=JCR&RQ=IF_CAT_BOXPLO
1. A study of graph eigenvectors shows connections to graph structure in ways that are reminiscent o...
AbstractThe energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. I...
给出了第二大特征值不超过 5 - 12 的所有连通线图 ,它们包括三大类和十个特殊情形The connected line graphs with the second largest eigenva...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gate...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cg...
[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVe...
Abstract. A graph is called circulant if it is a Cayley graph on a cyclic group, i.e. its adjacency ...
Submitted by W. Haemers Let G be a finite graph of order n with an eigenvalue μ of multiplicity k. (...
From a generalization to $Z^n$ of the concept of congruence we define a family of regular digraphs o...
AbstractIn a previous paper we characterized unilevel block α-circulants A=[As-αr]r,s=0n-1, Am∈Cd1×d...
Circulant graphs are an important class of interconnection networks in parallel and distributed comp...
(A) Fiedler vector (GL eigenvector with the second smallest eigenvalue) for the graph in Schapiro et...
A graph is called textit{circulant} if it is a Cayley graph on acyclic group, i.e. its adjacency mat...
[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVe...
<p>Eigenvalues, Periods, Damping Ratios, and Three Highest Eigenvector Magnitudes of A<i><sub>C</sub...
1. A study of graph eigenvectors shows connections to graph structure in ways that are reminiscent o...
AbstractThe energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. I...
给出了第二大特征值不超过 5 - 12 的所有连通线图 ,它们包括三大类和十个特殊情形The connected line graphs with the second largest eigenva...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gate...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cg...
[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVe...
Abstract. A graph is called circulant if it is a Cayley graph on a cyclic group, i.e. its adjacency ...
Submitted by W. Haemers Let G be a finite graph of order n with an eigenvalue μ of multiplicity k. (...
From a generalization to $Z^n$ of the concept of congruence we define a family of regular digraphs o...
AbstractIn a previous paper we characterized unilevel block α-circulants A=[As-αr]r,s=0n-1, Am∈Cd1×d...
Circulant graphs are an important class of interconnection networks in parallel and distributed comp...
(A) Fiedler vector (GL eigenvector with the second smallest eigenvalue) for the graph in Schapiro et...
A graph is called textit{circulant} if it is a Cayley graph on acyclic group, i.e. its adjacency mat...
[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVe...
<p>Eigenvalues, Periods, Damping Ratios, and Three Highest Eigenvector Magnitudes of A<i><sub>C</sub...
1. A study of graph eigenvectors shows connections to graph structure in ways that are reminiscent o...
AbstractThe energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. I...
给出了第二大特征值不超过 5 - 12 的所有连通线图 ,它们包括三大类和十个特殊情形The connected line graphs with the second largest eigenva...