Zobrazeno 1 - 10
of 188
pro vyhledávání: '"Stephen T. Hedetniemi"'
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
Publikováno v:
Discrete Mathematics Letters, Vol 6, Pp 19-31 (2021)
Externí odkaz:
https://doaj.org/article/acd4bbed75054ef892c03b76c0ceaaf9
Publikováno v:
Discrete Mathematics Letters, Vol 6, Pp 1-7 (2021)
Externí odkaz:
https://doaj.org/article/ac2f2012edb743e9adb13a4aa830186f
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
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 1028-1038 (2020)
In this paper we introduce two concepts related to resolvability and the metric dimension of graphs. The kth dimension of a graph G is the maximum cardinality of a subset of vertices of G that is resolved by a set S of order k. Some first results are
Externí odkaz:
https://doaj.org/article/84bd270fd36248e29c3e875c5fd19759
Publikováno v:
Communications in Combinatorics and Optimization, Vol 5, Iss 1, Pp 69-81 (2020)
Let x and y be two distinct vertices in a connected graph G. The x, ylocation of a vertex w is the ordered pair of distances from w to x and y, that is, the ordered pair (d(x, w), d(y, w)). A set of vertices W in G is x, y-located if any two vertic
Externí odkaz:
https://doaj.org/article/103220c5d51f4a50a9948262f71629bf
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 1, Pp 139-148 (2020)
Let be a graph. For two disjoint sets of vertices and , set dominates set if every vertex in is adjacent to at least one vertex in . In this paper we introduce the upper domatic number , which equals the maximum order of a vertex partition such that
Externí odkaz:
https://doaj.org/article/e65bac7f4b05449c86645732f555e61f
Publikováno v:
Communications in Combinatorics and Optimization, Vol 4, Iss 2, Pp 151-171 (2019)
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$. The lower and upper different-distance number of a graph are the order of a smallest
Externí odkaz:
https://doaj.org/article/7f744179ede74385a340d96ee15cf757
Publikováno v:
Communications in Combinatorics and Optimization, Vol 4, Iss 2, Pp 109-122 (2019)
A set $S = \{u_1,u_2, \ldots, u_t\}$ of vertices of $G$ is an efficient dominating set if every vertex of $G$ is dominated exactly once by the vertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$% , we note that $\{U_1, U_2
Externí odkaz:
https://doaj.org/article/de35674b4c524468b35cb4cf3d2e55da
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 15, Iss 2, Pp 211-218 (2018)
For any integer , a set of vertices of a graph is -cost-effective if for every . In this paper we study the minimum cardinality of a maximal -cost-effective set and the maximum cardinality of a -cost-effective set. We obtain Gallai-type results invol
Externí odkaz:
https://doaj.org/article/e0a6179be0ca4132afa1b1569f98ed41