EUVIMEDEUVIMED entdecken
Crossref

Multiplicative Distance-Location Number of Graphs

KM. Kathiresan, S. Jeyagermani

Utilitas Mathematica · 2024

DOI: 10.61091/um120-04 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Utilitas Mathematica, 2024. Verfasst von KM. Kathiresan und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

For a set \( S \) of vertices in a connected graph \( G \), the multiplicative distance of a vertex \( v \) with respect to \( S \) is defined by \(d_{S}^{*}(v) = \prod\limits_{x \in S, x \neq v} d(v,x).\) If \( d_{S}^{*}(u) \neq d_{S}^{*}(v) \) for each pair \( u,v \) of distinct vertices of \( G \), then \( S \) is called a multiplicative distance-locating set of \( G \). The minimum cardinality of a multiplicative distance-locating set of \( G \) is called its multiplicative distance-location number \( loc_{d}^{*}(G) \). If \( d_{S}^{*}(u) \neq d_{S}^{*}(v) \) for each pair \( u,v \) of distinct vertices of \( G-S \), then \( S \) is called an external multiplicative distance-locating set of \( G \). The minimum cardinality of an external multiplicative distance-locating set of \( G \) is called its external multiplicative location number \( loc_{e}^{*}(G) \). We prove the existence or non-existence of multiplicative distance-locating sets in some well-known classes of connected graphs. Also, we introduce a family of connected graphs such that \( loc_{d}^{*}(G) \) exists. Moreover, there are infinite classes of connected graphs \( G \) for which \( loc_{d}^{*}(G) \) exists as well as infinite classes of connected graphs \( G \) for which \( loc_{d}^{*}(G) \) does not exist. A lower bound for the multiplicative distance-location number of a connected graph is established in terms of its order and diameter.

Zitieren

APA

Kathiresan, K., & Jeyagermani, S. (2024). Multiplicative Distance-Location Number of Graphs. Utilitas Mathematica. https://doi.org/10.61091/um120-04

Vancouver

Kathiresan K, Jeyagermani S. Multiplicative Distance-Location Number of Graphs. Utilitas Mathematica. 2024. doi:10.61091/um120-04

BibTeX
@article{Kathiresan2024,
  author = {Kathiresan, KM. and Jeyagermani, S.},
  title = {Multiplicative Distance-Location Number of Graphs},
  journal = {Utilitas Mathematica},
  year = {2024},
  doi = {10.61091/um120-04}
}
Kostenlos starten →