New parameters involving chromatic sum in a graph. (English) Zbl 1267.05192
Balakrishnan, R. (ed.) et al., International conference on graph theory and its applications. Papers from the conference, Coimbatore, India, December 11–13, 2008. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 33, 81-86 (2009).
Summary: In this paper, we introduce four parameters which involve chromatic sum and independent domination. Corresponding to the chromatic sum coloring of \(G\), the chromatic domination number, chromatic sum edge stability number, chromatic sum bondage number and domination chromatic sum color number are defined and studied.
For the entire collection see [Zbl 1239.05003].
For the entire collection see [Zbl 1239.05003].
MSC:
| 05C69 | Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) |
| 05C15 | Coloring of graphs and hypergraphs |
Keywords:
chromatic sum coloring; independent domination; chromatic sum bondage number; chromatic domination number; chromatic sum edge stability number; domination chromatic sum color numberReferences:
| [1] | Kubicka, Ewa; Schwenk, Allen J., An introduction to chromatic sums, (Proc. ACM Computer Science Conference. Proc. ACM Computer Science Conference, Louisville (Kentucky) (1989)), 39-45 |
| [2] | Kubicka, Ewa, The chromatic sum of a graph: history and recent developments, Int. J. Math. Math. Sci., 29-32, 1563-1573 (2004) · Zbl 1064.05062 |
| [3] | Walikar, H. B.; Acharya, B. D.; Shekharappa, H. G.; Narayankar, Kishori, Embedding Index of Nonindominable Graphs, (Proceedings of the National Confeerence on Graphs, Combinatorics, Algorithms and Applications (2004), AKCE, Narosa Publishing House: AKCE, Narosa Publishing House New Delhi), 173-179 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
