CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Location-domination in line graphs
Authors
Florent Foucaud
Michael A. Henning
Publication date
22 July 2016
Publisher
'Elsevier BV'
Doi
Cite
View
on
arXiv
Abstract
A set
D
D
D
of vertices of a graph
G
G
G
is locating if every two distinct vertices outside
D
D
D
have distinct neighbors in
D
D
D
; that is, for distinct vertices
u
u
u
and
v
v
v
outside
D
D
D
,
N
(
u
)
∩
D
â‰
N
(
v
)
∩
D
N(u) \cap D \neq N(v) \cap D
N
(
u
)
∩
D
î€
=
N
(
v
)
∩
D
, where
N
(
u
)
N(u)
N
(
u
)
denotes the open neighborhood of
u
u
u
. If
D
D
D
is also a dominating set (total dominating set), it is called a locating-dominating set (respectively, locating-total dominating set) of
G
G
G
. A graph
G
G
G
is twin-free if every two distinct vertices of
G
G
G
have distinct open and closed neighborhoods. It is conjectured [D. Garijo, A. Gonzalez and A. Marquez, The difference between the metric dimension and the determining number of a graph. Applied Mathematics and Computation 249 (2014), 487--501] and [F. Foucaud and M. A. Henning. Locating-total dominating sets in twin-free graphs: a conjecture. The Electronic Journal of Combinatorics 23 (2016), P3.9] respectively, that any twin-free graph
G
G
G
without isolated vertices has a locating-dominating set of size at most one-half its order and a locating-total dominating set of size at most two-thirds its order. In this paper, we prove these two conjectures for the class of line graphs. Both bounds are tight for this class, in the sense that there are infinitely many connected line graphs for which equality holds in the bounds.Comment: 23 pages, 2 figure
Similar works
Full text
Available Versions
HAL Clermont Université
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:HAL:hal-03041286v1
Last time updated on 08/01/2021