2020
DOI: 10.1007/s11253-020-01846-2
|View full text |Cite
|
Sign up to set email alerts
|

Covering Codes of a Graph Associated with a Finite Vector Space

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 24 publications
0
1
0
Order By: Relevance
“…Proposition 2.1 (Murtaza, 2020). Suppose that u, v are twins in a connected graph G and L d is a locating-dominating set of G. Then either…”
Section: Location-domination Polynomials and Locating-dominating Valuesmentioning
confidence: 99%
“…Proposition 2.1 (Murtaza, 2020). Suppose that u, v are twins in a connected graph G and L d is a locating-dominating set of G. Then either…”
Section: Location-domination Polynomials and Locating-dominating Valuesmentioning
confidence: 99%