Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Raghuveer Mohan"'
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
Publikováno v:
Natural Hazards. 100:1013-1036
As the frequency of natural disasters increases, there has been an emphasis on vulnerability index creation studies. In this study, we test the validity of vulnerability indices by examining a vulnerability index created for nursing homes throughout
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
Publikováno v:
ACM Southeast Regional Conference
Teaching computer science theory is often challenging due to the very nature of the field - its reliance on a solid mathematical foundation, logical reasoning, and the ability to use abstractions. As such, visualization tools have been developed to p
Autor:
Raghuveer Mohan, Brian C. Dean
Publikováno v:
Information Processing Letters. 113:345-349
One can build a Cartesian tree from an n-element sequence in O ( n ) time, and from an n-node free tree in O ( n log n ) time (with a matching worst-case lower bound in the comparison model of computation). We connect these results together by descri
Publikováno v:
Proceedings of the 46th ACM Technical Symposium on Computer Science Education.
Despite their power and simplicity, randomized algorithms are often under-emphasized in the classroom (and as a consequence, ultimately in practice) since they can be more challenging to analyze than their deterministic counterparts. In this paper, w