Domination and Chromatic Number of Pan Graph and Lollipop Graph
Nigar Siddiqui#1, Mohit James*2
#
Department of Mathematics, SHUATS
1
[email protected] 2
[email protected]Abstract— Domination number and Chromatic number are important characteristics of a graph. Lollipop and Pan Graphs are
special types of Graphs. A dominating set of a graph G=(V , E ) G= (V , E ) is a subset D of E such that every vertex
not in D D is adjacent to atleast one vertex of D . The domination number γ (G) γ ( G )of a graph G is the cardinality
of a smallest dominating set. In this paper, we determine the domination number and chromatic number of pan graph and
lollipop graph.
Keywords— Domination number, Chromatic number, Pan graph, Lollipop graph.
I. INTRODUCTION
Domination Number
G=(V , E ) be a graph, a subset D of V (G) is said to dominating set for a graph G if every vertex not in
Let
D is adjacent to at least one member of D . The domination number γ (G) is the number of vertices in a
smallest dominating set for G.
(a) (b) (c)
Fig 1.1 Domination Number
In this example V (G)={1,2,3,4,5,6} Subset D for Graph (a), (b) and (c) are {6,3}, {1,5,6} and {2,3} . So its
vertex dominating number γ (G)=2 .
Chromatic Number
The Chromatic number of a graph is the minimum number of colours needed to colour the vertices of Graph so that no two
adjacent vertices share the same colour. It is denoted by χ(G) .
χ(G)=3 χ(G)=4
Fig.1.2 Chromatic Number
Pan Graph
obtained by joining a cycle graph
Cn to a singleton graph
K 1 with a bridge. It is denoted by
The pan graph is the graph
Pn .
Fig. 1.3 Pan graph
Lollipop Graph Lm , n
The lollipop graph is the graph obtained by joining a complete graph
Km to a path graph
Pn pnwith a bridge. It is
denoted by Lm , n Lm,n .
L3,1 L4,1
Fig. 1.4 Lollipop Graph
II. RESULT AND DISCUSSION
We used induction method to obtained Domination number and Chromatic number for Pan Graph
PAN GRAPH
TABLE 2.1 PAN GRAPH
S. Pan Graph (Pn) Graph γ (G) χ(G)
No.
1 n=3 , P3 γ ( P3 )=1 χ ( P3 )=3
2 n=4 , P 4 γ ( P4 )=2 χ ( P4 )=2
3 n=5 , P5 γ ( P5 )=2 χ ( P5 )=3
γ ( P6 )=2 γ ( P6 )=2
4 n=6, P 6
γ ( P7 )=3 γ ( P7 )=3
5 n=7 , P 7
γ ( P8 )=3 γ ( P8 )=2
6 n=8, P 8
γ ( P9 )=3 γ ( P9 )=3
7 n=9, P 9
γ ( P10 )=4 γ ( P10 )=2
8 n=10 , P10
TABLE 2.2 LOLLIPOP GRAPH (
L3,n )
S. Lollipop (
No. L3,n ) Graph γ (G) χ(G)
1 L3,1 γ ( L 3,1 )=1 χ( L 3,1 )=3
2 L3,2 γ ( L 3,2 )=2 χ ( L 3,2 )=3
3 L3,3 γ ( L 3,3 )=2 χ ( L 3,3 )=3
4 L3,4 γ ( L 3,4 )=2 χ ( L 3,4 )=3
5 L3,5 γ ( L 3,5 )=3 χ ( L 3,5 )=3
6 L3,6 γ ( L 3,6 )=3 χ ( L 3,6 )=3
7 L3,7 γ ( L 3,7 )=3 χ ( L 3,7 )=3
8 L3,8 γ ( L 3,8 )=4 χ ( L 3,8 )=3
9 L3,9 γ ( L 3,9 )=4 χ( L 3,9 )=3
10 L3,10 γ ( L 3,10 )=4 χ( L 3 ,10 )=3
TABLE 2.3 LOLLIPOP GRAPH (
L4 ,n )
Lollipop (
S. No. L4 ,n ) Graph γ (G) χ(G)
1 L4,1 γ ( L4,1 )=1 χ ( L4,1 )=4
2 L4,2 γ ( L4,2 )=2 χ ( L4,2 )=4
3 L4,3 γ ( L4,3 )=2 χ ( L4,3 )=4
4 L4,4 γ ( L4,4 )=2 χ ( L4,4 )=4
5 L4,5 γ ( L4,5 )=3 χ( L4,5 )=4
6 L4,6 γ ( L4,6 )=3 χ ( L4,6 )=4
7 L4,7 γ ( L4,7 )=3 χ( L4,7 )=4
8 L4,8 γ ( L4,8 )=4 χ( L4,8 )=4
9 L4,9 γ ( L4,9 )=4 χ( L4,9 )=4
10 L4 ,10 γ ( L4 ,10 )=4 χ( L4 , 10 )=4
TABLE 2.4 LOLLIPOP GRAPH (
L5,n )
S. Lollipop (
No. L5,n ) Graph γ (G) χ(G)
1 L5,1 γ ( L5,1)=1 χ( L5,1 )=5
2 L5,2 γ ( L5,2)=2 χ ( L5,2 )=5
3 L5,3 γ ( L5,3 )=2 χ ( L5,3 )=5
4 L5,4 γ ( L5,4 )=2 χ ( L5,4 )=5
5 L5,5 γ ( L5,5)=3 χ ( L5,5 )=5
6 L5,6 γ ( L5,6 )=3 χ ( L5,6 )=5
7 L5,7 γ ( L5,7 )=3 χ ( L5,7 )=5
8 L5,8 γ ( L5,8 )=4 χ ( L5,8 )=5
9 L5,9 γ ( L5,9 )=4 χ ( L5,9 )=5
10 L5,10 γ ( L5, 10 )=4 χ ( L5 ,10 )=5
III. CONCLUSION
From the Table 2.1, we conclude that
Pn
a) Chromatic number for Pan Graph is
χ ( Pn )=3 , if n is odd
= 2 , if n is even
Pn
b) Domination number for Pan Graph is
n
Υ ( Pn )= for 3 n i .e . ,3,6,9,12 , …
3
n
¿ ⌈ ⌉ for others
3
Where, ⌈ ⌉ is defined as the greatest integer.
From the Table 2.2, 2.3 and 2.4 we conclude that
a) Chromatic number for Lollipop graph
Lm ,n is χ ( Lm , n ) =m
n+2
γ ( Lm , n ) =⌈ ⌉
b) Domination number for Lollipop Graph
Lm ,n is 3
Where, is ⌈ ⌉ defined as the greatest integer.
REFERENCE
[1]. Alikhani ,S. and Peng, Y.H.[2014] “Introduction to Domination polynomial of a Graph .” Ars.114,257-266.Combinatoria
[2] Brandstadt V. B. and Le Spinrad J.P. [1987] Graph Classes: A Survey. Philadelphia. PA:SIAM,p.19.
[3] Chartrand,G.[1985] “Introductory graph theory.” Mineola, NY:Dover Publications.
[4] Cockayen E.J., Dreyer P.A., Jr., Hedetniemi S.M., Hedetniemi S.T., MeRae. A.A.[2004] “ The algrothmic complexity of
Roman domination”, Science direct Discrete Mathematics ,vol.278,pp. 11-22.
[5] Cooper,C. Klasing,R. andZito,M. [2005]. “Lower Bounds and Algorithms for Dominating Sets in Web Graphs”, InternetMath.
Vol.2, No.3, pp.275-300.
[6] Eppstein,D. “The Chromatic Number of the Plane.” http://www.ics.uci.edu/~ eppstei /junkyar /plane-color.html.
[7] Erfang, S. , Liang, S. and Liying, K. [1998] “Some results on domination number of products of graphs”,Applied
Mathematics,Vol. 13,pp.103-108
[8] E. Sambathkumar and H.B. Walikar[1979], “The connected domination of a graph, Math. Phys. Sci.,607-613.
[9] Mehrotra, A. and Trick, M.A. [1996] “A Column Generation Approach for Graph Coloring.”INFORMS J.on Computing 8,344-
354.
[10] Michael D.P. [2006] “Some recent result on Domination in Graphs”. Graph Theory, vol. 26 , pp. 457-474.
[11] Michael D. Plummer, “Some recent result on Domination in Graphs” Journal of Graph Theory, vol. 26, 457-474, 2006.
[12] Mohit James “Domination Number in Sierprinski 4-cycle graph”, Internationl Journal of Mathematics Trends and
Technology, Volume 52, 562-569 2017
[13] Robert E.D. [2000] “Vertices in Total Dominating Sets”, http://dc.etsu.etd, vol. 5.
[14] Rosen,K.[1999] “Discrete Mathematics and its applications ,4th ed. Boston, MA: McGraw-Hill.
[15] Vijayan,J.Sherina Beul, “Edge-Vertex Dominating Sets and Edge- Vertex Domination Polynomial of cycles”, Open Journal of
Discrete Mathematics, vol. 5, 74-8 2014.
