On self-clique graphs / Ong Poh Hwa
The clique graph of a graph G is the graph obtained by taking the cliques of G as vertices, and two vertices are adjacent if and only if the corresponding cliques have non-empty intersection. A graph G is self-clique if it is isomorphic to its clique graph. Clique graphs have been studied for some t...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://studentsrepo.um.edu.my/6094/1/thesis_1.pdf http://studentsrepo.um.edu.my/6094/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|