Access the full text.
Sign up today, get DeepDyve free for 14 days.
Further properties of graph angles
P. Rowlinson (1987)
A deletion-contraction algorithm for the characteristic polynomial of a multigraphProceedings of the Royal Society of Edinburgh: Section A Mathematics, 105
(1985)
Theory of Matrices Second edition
F. Bell, P. Rowlinson (1988)
The change in index of a graph resulting from the attachment of a pendant edgeProceedings of the Royal Society of Edinburgh: Section A Mathematics, 108
C. Godsil, B. McKay (1981)
Spectral conditions for the reconstructibility of a graphJ. Comb. Theory, Ser. B, 30
P. Lancaster, M. Tismenetsky (1969)
The theory of matrices
(1985)
TISMENETSKY, Theory of Matrices Second edition
(1909)
ScotlandBritish Medical Journal, 1
D. Cvetkovic, Michael Doob (1985)
Developments in the theory of graph spectraLinear & Multilinear Algebra, 18
(1960)
GANTMACHER, Theory of matrices, Vol. II (Chelsea
PETER ROWLINSON 1. Introduction We consider only finite undirected graphs without loops or multiple edges. Let G be a non-trivial connected graph whose vertices are labelled 1,2,..., n and let A be the corresponding (0, l)-adjacency matrix of G. Let A have spectral form to P +.. . + fi P where to > ... > // : the largest eigenvalue n is called the index of G. x m m m x For ie (1,... , m) andy e {1,...,«} , let cos" (a ) be the angle between the ith eigenspace E(n^ and the yth co-ordinate axis. Thus if e ...,e comprise the standard 15 n orthonormal basis of U then <x = \P e \. The a themselves are customarily referred tj t } w to as angles of G, abusing terminology: their value as graph invariants has been noted 1 1 in [3]. Here we shall consider also the invariants y$, where cos" ^ ) is the angle between P e and P e . Note that the (j, fc)-entry p £ of P is a a y$. t } t k t y Jfc Suppose that G is a spanning subgraph of the graph
Bulletin of the London Mathematical Society – Wiley
Published: May 1, 1988
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.