آمار

تعداد نشریات26
تعداد شماره‌ها306
تعداد مقالات2,645
تعداد مشاهده مقاله3,966,023
تعداد دریافت فایل اصل مقاله2,671,217
Abdul Khayyoom, Mohammed, Sudhahar, P.Arul Paul. (1402). The open monophonic chromatic number of a graph. سامانه مدیریت نشریات علمی, 11(2), 225-235. doi: 10.22098/jhs.2023.2575
Mohammed Abdul Khayyoom; P.Arul Paul Sudhahar. "The open monophonic chromatic number of a graph". سامانه مدیریت نشریات علمی, 11, 2, 1402, 225-235. doi: 10.22098/jhs.2023.2575
Abdul Khayyoom, Mohammed, Sudhahar, P.Arul Paul. (1402). 'The open monophonic chromatic number of a graph', سامانه مدیریت نشریات علمی, 11(2), pp. 225-235. doi: 10.22098/jhs.2023.2575
Abdul Khayyoom, Mohammed, Sudhahar, P.Arul Paul. The open monophonic chromatic number of a graph. سامانه مدیریت نشریات علمی, 1402; 11(2): 225-235. doi: 10.22098/jhs.2023.2575

The open monophonic chromatic number of a graph

Journal of Hyperstructures
دوره 11، شماره 2، اسفند 2022، صفحه 225-235    اصل مقاله (322.37 K)
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22098/jhs.2023.2575
نویسندگان
Mohammed Abdul Khayyoom* 1؛ P.Arul Paul Sudhahar2
1Department of Mathematics, PTM Govt. College, Perinthalmanna P.O.679322 Malappuram, Kerala, India
2Department of Mathematics, Rani Anna Govt.College(W) Tirunalveli-627 008, Tamilnadu, India.
چکیده
A set P of vertices in a connected graph G is called open monophonic chromatic set if P is both an open monophonic set and a chromatic set. The minimum cardinality among the set of all open monophonic chromatic sets is called open monophonic chromatic number and is denoted by χom(G). Here properties of open monophonic chromatic number of connected graphs are studied. Open monophonic chromatic number of some standard graphs are identified. For 3≤ m ≤n, there is a connected graph G such that χ(G)= m and χom(G)=n. For 3≤ m ≤n, there is a connected graph Gsuch that om(G)=m and χ(G)= χom(G)=n. Let r, d be two integers such that r< d ≤ 2r and suppose k≥ 2. Then there exists a connected graph G with rad(G) = r, diam(G) = d and χom(G)=k.
کلیدواژه‌ها
Chromatic set؛ Chromatic number؛ Open Monophonic number؛ Open Monophonic chromatic number
مراجع
[1] P Arul Paul Sudhahar, M Mohammed Abdul Khayyoom and A Sadiquali, Edge Monophonic Domination Number of Graphs, J.Adv.in Mathematics, Vol 11 (10) (2016), 5781-5785.
[2] P Arul Paul Sudhahar, M Mohammed Abdul Khayyoom and A Sadiquali, The Connected Edge Monophonic Domination Number of Graphs, Int.J Comp.Applications, Vol 145 (12),( 2016), 18-21 .
[3] F.Buckley, and F.Harary: Distance in Graphs Addition Wesley, Redwood City, (1990)
[4] Gary Chartrand and P.Zhang, Introduction to Graph Theory, MacGraw Hill (2005).
[5] Geir Agnarsson, R Green law, Graph theory: Modeling, Application and Algorithms Pearson(2007).
[6] J.John and P.Arul Paul Sudhahar On The Edge Monophonic Number of a Graph Filomat. Vol.26.6 (2012) 1081-1089.
[7] J.John and P.Arul Paul Sudhahar The Monophonic Domination Number of a Graph:Proceedings of the International Conference on Mathematics and Buisness Managment, (2012) 142-145.
[8] M.Mohammed Abdul Khayyoom and P.Arul Paul Sudhahar. Edge Detour Monophonic Domination Number of a Graph. International Journal of Pure and Applied Mathematics,Vol 120(7),(2018), 195-203 OMC Number of a Graph 235
[9] M.Mohammed Abdul Khayyoom and P.Arul Paul Sudhahar. Connected Detour Monophonic Domination Number of a Graph , Global Journal of Pure and Applied Mathematics, Vol. 13(5) (2017)
[10] M.Mohammed Abdul Khayyoom and P.Arul Paul Sudhahar. Monophonic Chromatic Parameter in a Connected Graph . International Journal of Mathematical Analysis, Vol. 11 (19),(2017 ), 911 - 920.
[11] A. Sadiquali and P.Arul Paul Sudhahar, Upper Monophonic Domination Number of a Graph, International Journal of Pure and Applied Mathematics, Vol.120(7), (2018), 165-173 .
[12] A.P. Santhakumaran and M. Mahendran, The Open Monophonic Number of a Graph International Journal of Scienti c and Engineering Research, Vol 5 (2),2014

آمار
تعداد مشاهده مقاله: 13
تعداد دریافت فایل اصل مقاله: 23


سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب