1998
DOI: 10.1002/(sici)1097-0118(199805)28:1<49::aid-jgt6>3.0.co;2-f
|View full text |Cite
|
Sign up to set email alerts
|

Strict majority functions on graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
9
0

Year Published

2001
2001
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 11 publications
(9 citation statements)
references
References 4 publications
(11 reference statements)
0
9
0
Order By: Relevance
“…The conjecture has been strengthened by Henning [41] when (n+1)/2 < k n (see Theorem 23). Kang, et al [40] gave the following approximate result.…”
Section: Signed K-subdomination In Graphsmentioning
confidence: 93%
See 3 more Smart Citations
“…The conjecture has been strengthened by Henning [41] when (n+1)/2 < k n (see Theorem 23). Kang, et al [40] gave the following approximate result.…”
Section: Signed K-subdomination In Graphsmentioning
confidence: 93%
“…Cockayne and Mynhardt [10] also gave another conjecture: for any connected graph G of order n and any k with n/2 < k n, γ ks (G) 2k − n. Henning [41] disproved the conjecture in the special case when k = (n + 1)/2 . The conjecture has been strengthened by Henning [41] when (n+1)/2 < k n (see Theorem 23).…”
Section: Signed K-subdomination In Graphsmentioning
confidence: 99%
See 2 more Smart Citations
“…When k = |V |/2 , we have the weak majority number (also called the majority domination number) studied in [1,2,19] and elsewhere. When k = (|V | + 1)/2 , we have the strict majority function studied in [15] and elsewhere.…”
Section: Introductionmentioning
confidence: 99%