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
|
|
Author(s): Sk. Amanathulla (Vidyasagar University, India) and Madhumangal Pal (Vidyasagar University, India)
Copyright: 2020
Pages: 36
Source title:
Handbook of Research on Advanced Applications of Graph Theory in Modern Society
Source Author(s)/Editor(s): Madhumangal Pal (Vidyasagar University, India), Sovan Samanta (Tamralipta Mahavidyalaya, India) and Anita Pal (National Institute of Technology Durgapur, India)
DOI: 10.4018/978-1-5225-9380-5.ch007
Purchase
|
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
|
Arunaben Prahladbhai Gurjar, Shitalben Bhagubhai Patel.
© 2022.
30 pages.
|
|
Meghna Babubhai Patel, Jagruti N. Patel, Upasana M. Bhilota.
© 2022.
10 pages.
|
|
Vo Ngoc Phu, Vo Thi Ngoc Tran.
© 2022.
27 pages.
|
|
Steven Walczak.
© 2022.
17 pages.
|
|
Priyanka P. Patel, Amit R. Thakkar.
© 2022.
26 pages.
|
|
Vo Ngoc Phu, Vo Thi Ngoc Tran.
© 2022.
34 pages.
|
|
Sarat Chandra Nayak, Subhranginee Das, Bijan Bihari Misra.
© 2022.
20 pages.
|
|
|