𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graph equations for line graphs, total graphs, middle graphs and quasi-total graphs

✍ Scribed by D.V.S Sastry; B.Syam Prasad Raju

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
219 KB
Volume
48
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The decompositions of line graphs, middl
The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests
✍ Jin Akiyama; Takashi Hamada πŸ“‚ Article πŸ“… 1979 πŸ› Elsevier Science 🌐 English βš– 461 KB

We construct decompositions of L(K,,), M(K,,) and T(K,,) into the minimum number of line-disjoint spanning forests by applying the usual criterion for a graph to be eulerian. This gives a realization of the arboricity of each of these three graphs. ## 1. Preliminaries In this paper a graph is cons

Perfect k-line graphs and k-total graphs
Perfect k-line graphs and k-total graphs
✍ Van Bang LΓͺ πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 443 KB πŸ‘ 1 views

## Abstract The concept of the line graph can be generalized as follows. The __k__‐line graph __L__~__k__~(__G__) of a graph __G__ is defined as a graph whose vertices are the complete subgraphs on __k__ vertices in __G.__ Two distinct such complete subgraphs are adjacent in __L__~__k__~(__G__) if

Coloring quasi-line graphs
Coloring quasi-line graphs
✍ Maria Chudnovsky; Alexandra Ovetsky πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 127 KB

## Abstract A graph __G__ is a quasi‐line graph if for every vertex __v__, the set of neighbors of __v__ can be expressed as the union of two cliques. The class of quasi‐line graphs is a proper superset of the class of line graphs. A theorem of Shannon's implies that if __G__ is a line graph, then