The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
L(h,k)-Labeling of Intersection Graphs
Abstract
One important problem in graph theory is graph coloring or graph labeling. Labeling problem is a well-studied problem due to its wide applications, especially in frequency assignment in (mobile) communication system, coding theory, ray crystallography, radar, circuit design, etc. For two non-negative integers, labeling of a graph is a function from the node set to the set of non-negative integers such that if and if, where it represents the distance between the nodes. Intersection graph is a very important subclass of graph. Unit disc graph, chordal graph, interval graph, circular-arc graph, permutation graph, trapezoid graph, etc. are the important subclasses of intersection graphs. In this chapter, the authors discuss labeling for intersection graphs, specially for interval graphs, circular-arc graphs, permutation graphs, trapezoid graphs, etc., and have presented a lot of results for this problem.
Related Content
|
Vinod Kumar, Himanshu Prajapati, Sasikala Ponnusamy.
© 2023.
18 pages.
|
|
Sougatamoy Biswas.
© 2023.
14 pages.
|
|
Ganga Devi S. V. S..
© 2023.
10 pages.
|
|
Gotam Singh Lalotra, Ashok Sharma, Barun Kumar Bhatti, Suresh Singh.
© 2023.
15 pages.
|
|
Nimish Kumar, Himanshu Verma, Yogesh Kumar Sharma.
© 2023.
16 pages.
|
|
R. Soujanya, Ravi Mohan Sharma, Manish Manish Maheshwari, Divya Prakash Shrivastava.
© 2023.
12 pages.
|
|
Nimish Kumar, Himanshu Verma, Yogesh Kumar Sharma.
© 2023.
22 pages.
|
|
|