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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
John Wiley & Sons
1981
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/33887/ http://psasir.upm.edu.my/id/eprint/33887/1/a25%20-%20on%20graphs%20without%20multicliqual%20edges.pdf |
| _version_ | 1848847623215120384 |
|---|---|
| author | Lim, Chong Keang Peng, Yee Hock |
| author_facet | Lim, Chong Keang Peng, Yee Hock |
| author_sort | Lim, Chong Keang |
| building | UPM Institutional Repository |
| collection | Online Access |
| 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. |
| first_indexed | 2025-11-15T09:21:33Z |
| format | Article |
| id | upm-33887 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T09:21:33Z |
| publishDate | 1981 |
| publisher | John Wiley & Sons |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-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 |
| spellingShingle | Lim, Chong Keang Peng, Yee Hock On graphs without multicliqual edges |
| title | 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_short | On graphs without multicliqual edges |
| title_sort | on graphs without multicliqual edges |
| url | http://psasir.upm.edu.my/id/eprint/33887/ http://psasir.upm.edu.my/id/eprint/33887/ http://psasir.upm.edu.my/id/eprint/33887/1/a25%20-%20on%20graphs%20without%20multicliqual%20edges.pdf |