𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Characterizations of Classes of Graphs Recognizable by Local Computations

✍ Scribed by Emmanuel Godard; Yves Métivier; Anca Muscholl

Book ID
105914707
Publisher
Springer
Year
2004
Tongue
English
Weight
464 KB
Volume
37
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Characterizing intersection classes of g
Characterizing intersection classes of graphs
✍ Edward R. Scheinerman 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 571 KB

A graph is an intersection graph if it is possible to assign sets to its vertices so that adjacency corresponds exactly to nonempty intersection. If the sets assigned to vertices must belong to a pre-specified family, the resulting class of all possible intersection graphs is called an intersection

Some characterizations of graphs by star
Some characterizations of graphs by star complements
✍ 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