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: | Lim, Chong Keang, Peng, Yee Hock |
---|---|
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!
|
Similar Items
-
On the chromaticity of complete multipartite graphs with certain edges added
by: Lau, G. C., et al.
Published: (2008) -
On the Higher Order Edge-Connectivity of Complete Multipartite Graphs
by: Peng, Y. H., et al.
Published: (1989) -
Two families of chromatically unique graphs.
by: Yee, Hock Peng
Published: (1992) -
Conditions on the edges and vertices of non-commuting graph
by: Jahandideh, Maryam, et al.
Published: (2015) -
On the factor-thickness of regular graphs
by: Peng, Yee Hock, et al.
Published: (1989)