Opuscula Mathematica

Opuscula Math.
, no. 3
 (), 279-285
Opuscula Mathematica

Strong geodomination in graphs

Abstract. A pair \(x\), \(y\) of vertices in a nontrivial connected graph \(G\) is said to geodominate a vertex \(v\) of \(G\) if either \(v \in \{x, y\}\) or \(v\) lies in an \(x - y\) geodesic of \(G\). A set \(S\) of vertices of \(G\) is a geodominating set if every vertex of \(G\) is geodominated by some pair of vertices of \(S\). In this paper we study strong geodomination in a graph \(G\).
Keywords: geodomination, \(k\)-geodomination, open geodomination.
Mathematics Subject Classification: 05C12, 05C70.
Cite this article as:
Nader Jafari Rad, Doost Ali Mojdeh, Strong geodomination in graphs, Opuscula Math. 28, no. 3 (2008), 279-285
Download this article's citation as:
a .bib file (BibTeX), a .ris file (RefMan), a .enw file (EndNote)
or export to RefWorks.

RSS Feed

horizontal rule

ISSN 1232−9274, e-ISSN 2300−6919, DOI https://doi.org/10.7494/OpMath
Copyright © 2003−2017 OPUSCULA MATHEMATICA
Contact: opuscula@agh.edu.pl
Made by Tomasz Zabawa

horizontal rule

In accordance with EU legislation we advise you this website uses cookies to allow us to see how the site is used. All data is anonymized.
All recent versions of popular browsers give users a level of control over cookies. Users can set their browsers to accept or reject all, or certain, cookies.