Incidence dominating numbers of graphs

Subject Areas : Statistics

Parisa  Azizi Keshavarz ¹ (Department of Mathematic, Islamic Azad University, Science and Research Branch, Tehran, Iran)
Abolfazl .  Tehranian ² (Department of Mathematic, Islamic Azad University, Science and Research Branch, Tehran, Iran)

Received: 2018-10-29 Accepted : 2019-11-09 Published : 2020-07-01

Keywords: : رنگ آمیزی وقوعی, مجموعه احاطه گر, عدد رنگی,

Abstract :

In this paper, the concept of incidence domination number of graphs is introduced and the incidence dominating set and the incidence domination number of some particular graphs such as paths, cycles, wheels, complete graphs and stars are studied.

References:

 R.A. Brualdi, J.J.Q. Massey. Incidenceand strong edge colorings of graphs. Discrete Math 122: 51-58 (1993)

 

 G. Chartrand, P. Zhang. Introduction to graph theory. McGraw Hill, Boston (2005)

 

 R. M. Gera, S. Horton, C. Rasmussen. Dominator Coloring and Safe Clique Partitions. Congressus Numerantium 181 (7-9): 19-32 (2006)

 

 R. M. Gera. On Dominator colorings in graphs. Graph Theory Notes of New York, LIT 25-30 (2007)

 

 B. Guiduli. On incidence coloring and star arboricity of graphs. Discrete Math 163: 275-278 (1997)

 

 R.M. Gera. On the dominator colorings in bipartite graphs. ITNG.IEEE 1-6 (2007)

 

 O.Ore. Theory of graphs. no.38 in American Mathematical Society Publications, AMS, Providence (1962)

 

 T.Haynes, M. Henning. Domination in graphs of maximum degree 3. Discrete Math 292:131-141 (2005)

 

 F.V. Fomin, D.M. Thilikos. Dominating sets in planar graphs. Branch-width and exponential speed-up, Siam Journal on Computing 36(2): 281-309 (2006)

 

 M.Chellali, F. Maffray. Dominator colorings in some classes of graphs. Graphs and Combin 1-11(2011)

 

 I. Algor and N. Alon. The star arboricity of graphs. Discrete Math