Domination (totally) Dot-critical of Harary Graphs
A graph G is referred to as domination vertex critical if the removal of any vertex results in a reduction of the domination number. It is considered dot-critical (or totally dot-critical) if contracting any edge (or identifying any two vertices) leads to a decrease in the domination number. In this...
Published in: | Malaysian Journal of Mathematical Sciences |
---|---|
Main Author: | Hasni R.; Mojdeh D.A.; Bakar S.A. |
Format: | Article |
Language: | English |
Published: |
Universiti Putra Malaysia
2024
|
Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85191179713&doi=10.47836%2fmjms.18.1.01&partnerID=40&md5=ed9f6730d455bc6902e10af1b31d0287 |
Similar Items
-
Novel Concepts on Domination in Neutrosophic Incidence Graphs with Some Applications
by: Fitriah Mohamad S.N.; Hasni R.; Smarandache F.
Published: (2023) -
EVERY GRAPH IS LOCAL ANTIMAGIC TOTAL AND ITS APPLICATIONS
by: Lau G.-C.; Schaffer K.; Shiu W.C.
Published: (2023) -
On the vertex irregular reflexive labeling of generalized friendship graph and corona product of graphs
by: Yoong K.K.; Hasni R.; Lau G.C.; Ahmad A.
Published: (2024) -
Total Synthesis of Terpenes and Their Biological Significance: A Critical Review
by: Kanwal A.; Bilal M.; Rasool N.; Zubair M.; Shah S.A.A.; Zakaria Z.A.
Published: (2022) -
Edge Irregular Reflexive Labeling for Some Classes of Plane Graphs
by: Yoong K.K.; Hasni R.; Lau G.C.; Irfan M.
Published: (2022)