𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Characterizing line graphs by star complements

✍ Scribed by F.K. Bell


Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
114 KB
Volume
296
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Some characterizations of graphs by star
✍ DragoΕ‘ CvetkoviΔ‡; Peter Rowlinson; Slobodan K. SimiΔ‡ πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 158 KB

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. Various graphs related to (generalized) line graphs or their complements are characterized by star complements corresponding t

Star complements and exceptional graphs
✍ D. CvetkoviΔ‡; P. Rowlinson; S.K. SimiΔ‡ πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 151 KB
On graphs with complete bipartite star c
✍ P.S. Jackson; P. Rowlinson πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 119 KB

Let Β΅ be an eigenvalue of the graph G with multiplicity m. A star complement for Β΅ in G is an induced subgraph G -X such that |X| = m and Β΅ is not an eigenvalue of G -X. Some general observations concerning graphs with the complete bipartite graph K r,s (r + s > 2) as a star complement are followed

Clique-transversal sets of line graphs a
✍ Thomas Andreae; Martin Schughart; Zsolt Tuza πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 704 KB

Andreae, T., M. Schughart and Z. Tuza, Clique-transversal sets of line graphs and complements of line graphs, Discrete Mathematics 88 (1991) 11-20. A clique-transversal set T of a graph G is a set of vertices of G such that T meets all maximal cliques of G. The clique-transversal number, denoted t,(