On graphs without multicliqual edges
An edge which belongs to more than one clique of a given graph is called a multicliqual edge. We find a necessary and sufficient condition for a graph H to be the clique graph of some graph G without multicliqual edges. We also give a characterization of graphs without multicliqual edges that have a...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
John Wiley & Sons
1981
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/33887/1/a25%20-%20on%20graphs%20without%20multicliqual%20edges.pdf http://psasir.upm.edu.my/id/eprint/33887/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| id |
my.upm.eprints.33887 |
|---|---|
| record_format |
eprints |
| spelling |
my.upm.eprints.338872015-04-14T03:05:36Z http://psasir.upm.edu.my/id/eprint/33887/ On graphs without multicliqual edges Lim, Chong Keang Peng, Yee Hock An edge which belongs to more than one clique of a given graph is called a multicliqual edge. We find a necessary and sufficient condition for a graph H to be the clique graph of some graph G without multicliqual edges. We also give a characterization of graphs without multicliqual edges that have a unique critical generator. Finally, it is shown that there are infinitely many self-clique graphs having more than one critical generator. John Wiley & Sons 1981 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/33887/1/a25%20-%20on%20graphs%20without%20multicliqual%20edges.pdf Lim, Chong Keang and Peng, Yee Hock (1981) On graphs without multicliqual edges. Journal of Graph Theory, 5 (4). pp. 443-451. ISSN 0364-9024; ESSN: 1097-0118 10.1002/jgt.3190050416 |
| institution |
Universiti Putra Malaysia |
| building |
UPM Library |
| collection |
Institutional Repository |
| continent |
Asia |
| country |
Malaysia |
| content_provider |
Universiti Putra Malaysia |
| content_source |
UPM Institutional Repository |
| url_provider |
http://psasir.upm.edu.my/ |
| language |
English |
| description |
An edge which belongs to more than one clique of a given graph is called a multicliqual edge. We find a necessary and sufficient condition for a graph H to be the clique graph of some graph G without multicliqual edges. We also give a characterization of graphs without multicliqual edges that have a unique critical generator. Finally, it is shown that there are infinitely many self-clique graphs having more than one critical generator. |
| format |
Article |
| author |
Lim, Chong Keang Peng, Yee Hock |
| spellingShingle |
Lim, Chong Keang Peng, Yee Hock On graphs without multicliqual edges |
| author_facet |
Lim, Chong Keang Peng, Yee Hock |
| author_sort |
Lim, Chong Keang |
| title |
On graphs without multicliqual edges |
| title_short |
On graphs without multicliqual edges |
| title_full |
On graphs without multicliqual edges |
| title_fullStr |
On graphs without multicliqual edges |
| title_full_unstemmed |
On graphs without multicliqual edges |
| title_sort |
on graphs without multicliqual edges |
| publisher |
John Wiley & Sons |
| publishDate |
1981 |
| url |
http://psasir.upm.edu.my/id/eprint/33887/1/a25%20-%20on%20graphs%20without%20multicliqual%20edges.pdf http://psasir.upm.edu.my/id/eprint/33887/ |
| _version_ |
1643830998860824576 |
| score |
13.160551 |