2016
DOI: 10.1016/j.dam.2016.06.014
|View full text |Cite
|
Sign up to set email alerts
|

Efficient domination through eigenvalues

Abstract: The paper begins with a new characterization of (k, τ )-regular sets. Then, using this result as well as the theory of star complements, we derive a simplex-like algorithm for determining whether or not a graph contains a (0, τ )-regular set. When τ = 1, this algorithm can be applied to solve the efficient dominating set problem which is known to be NPcomplete. If −1 is not an eigenvalue of the adjacency matrix of the graph, this particular algorithm runs in polynomial time. However, although it doesn't work i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
6
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
3

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(7 citation statements)
references
References 33 publications
1
6
0
Order By: Relevance
“…Determination of a (0, τ )-regular set of an adverse graph by solving a linear system. The following theorem unifies the results obtained in [11,8] which can be applied for the determination of a (κ, τ )-regular set, with κ = 0 and τ = −λ min (G).…”
Section: 1supporting
confidence: 60%
See 2 more Smart Citations
“…Determination of a (0, τ )-regular set of an adverse graph by solving a linear system. The following theorem unifies the results obtained in [11,8] which can be applied for the determination of a (κ, τ )-regular set, with κ = 0 and τ = −λ min (G).…”
Section: 1supporting
confidence: 60%
“…However, in general, it is hard to decide whether the upper bound υ(G) coincides with the stability number α(G) and throughout more than two decades, this has been the main challenge within this topic. This survey starts in Section 2 by relating the convex quadratic program (11) with the Motzkin-Straus quadratic model for the determination of the clique (stability) number of a graph G [31] by the introduction of the parametric quadratic programs (1) and (4) whose optimal values, υ G (τ ) and ν G (τ ), are the inverse of each other and equal to α(G) in the former case (1/α(G) in the later) when τ = 1 (see (8)). Notice that (11) is obtained from (1) by setting τ = −λ min (G).…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…The fourth one explains 7.62%, which is only 44.84% of the inertia clarified by the previous dimension. Because the first three dimensions provide a 77.59% share of the data inertia together, we can set the number of statistically significant dimensions to three [ 31 ]. It means the three strongest self-governing regions – in terms of the strength from an angle of view of this analysis – are able to perform as the whole dataset.…”
Section: Resultsmentioning
confidence: 99%
“…Corollary 3.2. [12] If a graph G has a (κ, τ )-regular set S ⊆ V (G) and x is a particular solution of the linear system (1.1), then |S| = êT x.…”
Section: Determination Of (κ τ )-Regular Setsmentioning
confidence: 99%