You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
A DATABASE OF STAR COMPLEMENTS OF GRAPHS
D. Cvetković, M. Lepović, P. Rowlinson and S. Simić
Publikacije Elektrotehničkog fakulteta. Serija Matematika
No. 9 (1998), pp. 103-112
Published by: University of Belgrade, Serbia
Stable URL: http://www.jstor.org/stable/43666968
Page Count: 10
You can always find the topics here!Topics: Vertices, Eigenvalues, Databases, Spectral theory, Graph theory, Mathematical theorems, Mathematical complements, Induced subgraphs, Combinatorics, Line graphs
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
Let µ be an eigenvalue of the graph G with multiplicity k. A star complement for µ in G is an induced subgraph H = G — X such that | X | = k and µ is not an eigenvalue of G — X. The database contains about 1500 triples (G, H, µ) and is available as a supplement to the programming package "Graph". It was produced using (a) "Graph" itself, (b) programs developed independently by M. Lepović, and (c) data from other sources cited in the bibliography. This paper contains a description of the database and a commentary which explains how some interesting graphs can be obtained by extending appropriate star complements.
Publikacije Elektrotehničkog fakulteta. Serija Matematika © 1998 University of Belgrade, Serbia