Published February 28, 2021
| Version v1
Journal article
Open
Computation of Odd Geo-Domination Number of a Graph
Creators
- 1. Research Scholar, Department of Mathematics, Reg No. 11794, St. Xavier's (Autonomous) College, Palayamkottai, Tirunelveli.
- 2. Department of Mathematics, St. Xavier's (Autonomous) College, Palayamkottai, Tirunelveli.
Contributors
- 1. Publisher
Description
A geodominating set S ⊆ V of a graph G is said to be an odd geo-dominating set if for every vertex , , and The minimum cardinality of the odd geo-dominating set is called odd geo-domination number denoted by . The odd geo-dominating set with cardinality is called – set of G. We develop an algorithm to compute an odd geo-domination number of graphs and for some families of graphs.
Files
C21380210321.pdf
Files
(428.4 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:d92c9f2544449bb789a4c5c99e838a62
|
428.4 kB | Preview Download |
Additional details
Related works
- Is cited by
- Journal article: 2249-8958 (ISSN)
Subjects
- ISSN
- 2249-8958
- Retrieval Number
- 100.1/ijeat.C21380210321