k-perfect geodominating sets in graphs
A perfect geodominating set in a graph \(G\) is a geodominating set \(S\) such that any vertex \(v \in V(G)\setminus S\) is geodominated by exactly one pair of vertices of \(S\). A \(k\)-perfect geodominating set is a geodominating set \(S\) such that any vertex \(v \in V(G)\setminus S\) is geodomin...
Main Authors: | Doost Ali Mojdeh, Nader Jafari Rad |
---|---|
Format: | Article |
Language: | English |
Published: |
AGH Univeristy of Science and Technology Press
2007-01-01
|
Series: | Opuscula Mathematica |
Subjects: | |
Online Access: | http://www.opuscula.agh.edu.pl/vol27/1/art/opuscula_math_2705.pdf |
Similar Items
-
Strong geodomination in graphs
by: Nader Jafari Rad, et al.
Published: (2008-01-01) -
Cactus Graphs with Maximal Multiplicative Sum Zagreb Index
by: Chunlei Xu, et al.
Published: (2021-05-01) -
Quasi-Tree Graphs With Extremal General Multiplicative Zagreb Indices
by: Jianwei Du, et al.
Published: (2020-01-01) -
Ordering non-bipartite unicyclic graphs with pendant vertices by the least Q-eigenvalue
by: Shu-Guang Guo, et al.
Published: (2016-05-01) -
General Multiplicative Zagreb Indices of Graphs with a Small Number of Cycles
by: Monther R. Alfuraidan, et al.
Published: (2020-04-01)