Some new families of 5-cordial graphs
Journal: International Journal of Mathematics and Soft Computing (Vol.5, No. 1)Publication Date: 2015.01.01
Authors : M V Modha; K K Kanani;
Page : 129-141
Keywords : Neighborhood total domination; chromatic number.;
Abstract
Let $G=(V,E)$ be a graph without isolated vertices. A dominating set $S$ of $G$ is a neighborhood total dominating set (ntd-set) if the induced subgraph $leftlangle N(S)rightrangle$ of $G$ has no isolated vertices. The neighborhood total domination number $gamma_{nt}(G)$ is the minimum cardinality of a ntd-set. The minimum number of colours required to colour all the vertices such that no two adjacent vertices have same colour is the chromatic number $chi(G)$ of $G$. In this paper we find an upper bound for sum of the ntd-number and chromatic number and characterize the corresponding extremal graphs.
Other Latest Articles
- Weight Gain with the Levonorgestrel-Releasing Intrauterine System (LNG-IUS) Versus Depot Medroxyprogesterone Acetate (DMPA) Among Post- Partum Adolescents through 12 Months of Follow-up
- Square graceful labelings of some subdivision graphs
- Early Ultrasound Diagnosis of Placenta Accreta: A Case Report
- Spectral Conditions for a Graph to Contain Some Subgraphs
- The Management of Ovarian Cancer in Bangladesh: A Report of a Long-Term Survivor
Last modified: 2017-08-30 19:28:58