Computing the (k-)monopoly Number of Direct Product of Graphs
Computing the (k-)monopoly Number of Direct Product of Graphs
About this item
Full title
Author / Creator
Publisher
Faculty of Sciences and Mathematics, University of Niš
Journal title
Language
English
Formats
Publication information
Publisher
Faculty of Sciences and Mathematics, University of Niš
Subjects
More information
Scope and Contents
Contents
Let G = (V, E) be a simple graph without isolated vertices and minimum degree δ(G), and let k ∈ {1-[δ(G)/2,...,[δ(G)/2} be an integer. Given a set M ⊂ V, a vertex v of G is said to be k-controlled by M if
δ
M
(
v
)
≥
δ
(
v
)
2
+
k
where δM(v)represents the quantity of neighbors v has in M and δ(v) the degre...
Alternative Titles
Full title
Computing the (k-)monopoly Number of Direct Product of Graphs
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_crossref_primary_10_2298_FIL1505163K
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_crossref_primary_10_2298_FIL1505163K
Other Identifiers
ISSN
0354-5180
E-ISSN
2406-0933
DOI
10.2298/FIL1505163K
