A common generalization of line graphs and clique graphs
The thesis presents some characterizations for a graph to be a k-simplex graph. The first theorem gives a characterization of the existence of a simplex-edge cover, satisfying three properties, for a graph to be a k-simplex graph. The split graphs Hj , for some positive integers j will be classified...
Saved in:
Main Author: | Bernardo, Servando D., Jr. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2004
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_masteral/3137 https://animorepository.dlsu.edu.ph/context/etd_masteral/article/9975/viewcontent/CDTG003639_F_Redacted.pdf https://animorepository.dlsu.edu.ph/context/etd_masteral/article/9975/filename/0/type/additional/viewcontent/CDTG003639_F.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
Minimum 2-clique and 3-clique partitions of simple connected graphs
by: Alto, Washington Lee
Published: (1992) -
Clique algorithm
by: Tan, Marjovin N., et al.
Published: (2008) -
On the asymptotic spectral distribution of Cartesian powers of line graphs of complete graph
by: David, Monica Carlita G., et al.
Published: (2018) -
On the asymptotic spectral distribution of Cartesian powers of line graphs of complete graphs
by: David, Monica Carlita G., et al.
Published: (2018) -
Edge-regular graphs with regular cliques
by: Greaves, Gary Royden Watson, et al.
Published: (2019)