Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Alice A. McRae"'
Autor:
Teresa W. Haynes, Jason T. Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Raghuveer Mohan
Publikováno v:
Opuscula Mathematica, Vol 43, Iss 2, Pp 173-183 (2023)
A coalition in a graph \(G = (V, E)\) consists of two disjoint sets \(V_1\) and \(V_2\) of vertices, such that neither \(V_1\) nor \(V_2\) is a dominating set, but the union \(V_1 \cup V_2\) is a dominating set of \(G\). A coalition partition in a gr
Externí odkaz:
https://doaj.org/article/b3df3a20ff544610868fabda8b4b2337
Autor:
Teresa W. Haynes, Jason T. Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Raghuveer Mohan
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 2, Pp 653-659 (2020)
A coalition in a graph consists of two disjoint sets of vertices V1 and V2, neither of which is a dominating set but whose union is a dominating set. A coalition partition in a graph G of order is a vertex partition such that every set Vi of π eithe
Externí odkaz:
https://doaj.org/article/51f262e6fd2a4d8097738be8e96b1d1a
Autor:
Raghuveer Mohan, Alice A. McRae, Stephen T. Hedetniemi, Teresa W. Haynes, Jason T. Hedetniemi
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 2, Pp 653-659 (2020)
A coalition in a graph consists of two disjoint sets of vertices V1 and V2, neither of which is a dominating set but whose union is a dominating set. A coalition partition in a graph G of order is a vertex partition such that every set Vi of π eithe
Autor:
Teresa W. Haynes, Nicholas Phillips, Alice A. McRae, Jason T. Hedetniemi, Stephen T. Hedetniemi
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 1, Pp 139-148 (2020)
Let G = ( V , E ) be a graph. For two disjoint sets of vertices R and S , set R dominates set S if every vertex in S is adjacent to at least one vertex in R . In this paper we introduce the upper domatic number D ( G ) , which equals the maximum orde
Autor:
Teresa W. Haynes, Stephen T. Hedetniemi, Raghuveer Mohan, Jason T. Hedetniemi, Alice A. McRae
Publikováno v:
Discussiones Mathematicae Graph Theory.
Publikováno v:
Developments in Mathematics ISBN: 9783030588915
Given a graph G = (V, E) and a set S ⊆ V of vertices, we say that: (i) if a vertex v ∈ S, then v and all vertices in N(v) are observed, and (ii) (Kirchhoff’s Rule) if a vertex v is observed and there is a vertex u ∈ N(v) that is the only unob
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b6187160503018a050d059ebadbf6f1f
https://doi.org/10.1007/978-3-030-58892-2_15
https://doi.org/10.1007/978-3-030-58892-2_15
Publikováno v:
Developments in Mathematics ISBN: 9783030588915
A signed dominating function on a graph G = (V, E) is a function f : V →{−1, 1} satisfying the condition that for every vertex v ∈ V , the sum of the values assigned to v and all neighbors of v is at least 1, denoted f(N[v]) ≥ 1.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::95d461913caa17ac4ac3d2d23f75549a
https://doi.org/10.1007/978-3-030-58892-2_14
https://doi.org/10.1007/978-3-030-58892-2_14
Autor:
Teresa W. Haynes, Sandra M. Hedetniemi, Alice A. McRae, Stephen T. Hedetniemi, Mustapha Chellali
Publikováno v:
Graphs and Combinatorics. 32:79-92
For a graph $$G=(V,E)$$G=(V,E), a Roman dominating function $$f:V\rightarrow \{0,1,2\}$$f:V?{0,1,2} has the property that every vertex $$v\in V$$v?V with $$f(v)=0$$f(v)=0 has a neighbor $$u$$u with $$f(u)=2$$f(u)=2. The weight of a Roman dominating f
Publikováno v:
Discrete Applied Mathematics. 161:2885-2893
A subset S@?V in a graph G=(V,E) is a [j,k]-set if, for every vertex v@?V@?S, j@?|N(v)@?S|@?k for non-negative integers j and k, that is, every vertex v@?V@?S is adjacent to at least j but not more than k vertices in S. In this paper, we focus on sma
Publikováno v:
Discrete Applied Mathematics. 159:15-22
We present a collection of new structural, algorithmic, and complexity results for matching problems of two types. The first problem involves the computation of k-maximal matchings, where a matching is k-maximal if it admits no augmenting path with @