Results on the inverse majority domination and majority independence number of a graph
Künye
Manora, J. J. & Vignesh, S. (2021). Results on the inverse majority domination and majority independence number of a graph. TWMS Journal of Applied and Engineering Mathematics, 11(SI), 103-111.Özet
In this article,the relationship between Inverse Majority Domination number γ −1 M (G) and Majority Independence number βM(G) of a graph G is discussed for some classes of graphs. In particular, γ −1 M (G) and βM(G) for cubic and cubic bipartite graph are studied with examples. Also characterization theorem for this relation and some results are determined.
Kaynak
TWMS Journal of Applied and Engineering MathematicsCilt
11Sayı
SIBağlantı
https://hdl.handle.net/11729/3026http://jaem.isikun.edu.tr/web/index.php/archive/109-vol11-special-issue/639
Koleksiyonlar
Aşağıdaki lisans dosyası bu öğe ile ilişkilidir:
İlgili Öğeler
Başlık, yazar, küratör ve konuya göre gösterilen ilgili öğeler.
-
Results on majority dom-chromatic sets of a graph
Manora, J. Joseline; Mekala, R. (Işık University Press, 2021)A majority dominating set S ⊆ V (G) is said to be majority dominating chromatic set if S satisfies the condition χ(hSi) = χ(G). The majority dom-chromatic number γMχ(G) is the minimum cardinality of majority dominating ... -
Yatarak tedavi görmüş geriyatrik unipolar depresyon ve bipolar bozukluk hastaların klinik ve sosyodemografik özelliklerinin karşılaştırılması
Cesur, Ender; Fıstıkçı, Nurhan; Dönmezler, Fadime Gizem; Çarpar, Elif; Erten, Evrim; Keyvan, Ali; Saatçioğlu, İbrahim Ömer (Istanbul Universitesi, 2015-12)Amaç: Bipolar bozukluk, toplumda %1 oranında görülen kronik bir hastalık olmakla beraber, yaşlılardaki yaygınlık oranı % 0.1 kadar düşüktür. Major depresyonun ise 70-85 yaşından sonra prevalans ve insidansı iki kat ... -
Connected majority domination vertex critical graphs
Manora, J. Joseline; Vairavel, T. Muthukani (Işık University Press, 2021)In this article, how the removal of a single vertex from a graph G can change the Connected Majority Domination number is surveyed for any graph G. A graph is Connected Domination Critical if the removal of any vertex ...