Locating domination in bipartite graphs and their complements
Cita com:
hdl:2117/131573
Tipus de documentArticle
Data publicació2018-01-01
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
A set S of vertices of a graph G is distinguishing if the sets of neighbors in S for every pair of vertices not in S are distinct. A locating-dominating set of G is a dominating distinguishing set. The location-domination number of G, λ(G), is the minimum cardinality of a locating-dominating set. In this work we study relationships between λ(G) and λ(G) for bipartite graphs. The main result is the characterization of all connected bipartite graphs G satisfying λ(G) = λ(G) + 1. To this aim, we define an edge-labeled graph GS associated with a distinguishing set S that turns out to be very helpful.
Descripció
© 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
CitacióHernando, M.; Mora, M.; Pelayo, I. M. Locating domination in bipartite graphs and their complements. "Discrete applied mathematics", 1 Gener 2018.
ISSN0166-218X
Versió de l'editorhttps://www.sciencedirect.com/science/article/pii/S0166218X1830516X
Altres identificadorshttps://arxiv.org/pdf/1711.01951.pdf
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
LD in bipartite ... version enviada a DAM.pdf | 308,7Kb | Visualitza/Obre |