[[abstract]]The topological properties of eigenvectors of adjacency matrices of a graph have been analyzed. Model systems studied are n-vertex-m-edge (n-V-m-E) graphs where n = 2–4, m = 1–6. The topological information contained in these eigenvectors is described using vertex-signed and edge-signed graphs. Relative ordering of net signs of edge-signed graphs is similar to that of eigenvalues of the adjacency matrix. This simple analysis has also been applied to naphthalene, anthracene and pyrene. It provides a sound basis for the application of graph theory to molecular orbital theory.[[fileno]]2010321010017[[department]]化學
Atoms displayed as vertices and bonds can be shown by edges on a molecular graph. For such graphs we...
We develop majorization results that characterize changes in eigenvector components of a graph’s adj...
In this paper we introduce a new graph matrix, named the anti-adjacency matrix or eccentricity matri...
In this BSc thesis we deal with matrix graph theory. We are interested primarily in the eigenvalues ...
With every graph (or digraph) one can associate several different matrices. Here we shall concentrat...
To study dynamical systems, graphs are often used to capture the interactions among their components...
A graph can be represented by an adjacency matrix, with an entry of 1 at position i, j if the i^th n...
A graph can be represented by an adjacency matrix, with an entry of 1 at position i, j if the i^th n...
Spectral graph theory is an important interdisciplinary field of science and mathematics in which me...
These notes are not necessarily an accurate representation of what happened in class. The notes writ...
Two graphs having the same number of vertices connected in the same way are said to be isomorphic. T...
The present article is designed to be a contribution to the chapter `Combinatorial Matrix Theory and...
AbstractLet G=(V,E) be a simple graph with vertex set V={v1,v2,…,vn} and edge set E(G). The adjacenc...
Given a graph we can associate several matrices which record information about vertices and how they...
AbstractLet A be the adjacency matrix of a connected graph G. If z is a column vector, we say that a...
Atoms displayed as vertices and bonds can be shown by edges on a molecular graph. For such graphs we...
We develop majorization results that characterize changes in eigenvector components of a graph’s adj...
In this paper we introduce a new graph matrix, named the anti-adjacency matrix or eccentricity matri...
In this BSc thesis we deal with matrix graph theory. We are interested primarily in the eigenvalues ...
With every graph (or digraph) one can associate several different matrices. Here we shall concentrat...
To study dynamical systems, graphs are often used to capture the interactions among their components...
A graph can be represented by an adjacency matrix, with an entry of 1 at position i, j if the i^th n...
A graph can be represented by an adjacency matrix, with an entry of 1 at position i, j if the i^th n...
Spectral graph theory is an important interdisciplinary field of science and mathematics in which me...
These notes are not necessarily an accurate representation of what happened in class. The notes writ...
Two graphs having the same number of vertices connected in the same way are said to be isomorphic. T...
The present article is designed to be a contribution to the chapter `Combinatorial Matrix Theory and...
AbstractLet G=(V,E) be a simple graph with vertex set V={v1,v2,…,vn} and edge set E(G). The adjacenc...
Given a graph we can associate several matrices which record information about vertices and how they...
AbstractLet A be the adjacency matrix of a connected graph G. If z is a column vector, we say that a...
Atoms displayed as vertices and bonds can be shown by edges on a molecular graph. For such graphs we...
We develop majorization results that characterize changes in eigenvector components of a graph’s adj...
In this paper we introduce a new graph matrix, named the anti-adjacency matrix or eccentricity matri...