Zobrazeno 1 - 10
of 28
pro vyhledávání: '"N. R. Aravind"'
Autor:
Udit Maniyar, N. R. Aravind
Publikováno v:
Discrete Applied Mathematics. 319:216-222
We introduce and study a new graph representation where vertices are embedded in three or more dimensions, and in which the edges are drawn on the projections onto the axis-parallel planes. We show that the complete graph on $n$ vertices has a repres
Publikováno v:
Discrete Applied Mathematics. 319:254-270
In an undirected graph, a matching cut is a partition of vertices into two sets such that the edges across the sets induce a matching. The Matching Cut problem is the problem of deciding whether a given graph has a matching cut. Let H be a fixed undi
Autor:
N. R. Aravind, Roopam Saxena
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783031270505
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3738fe26f113a64d240b3d672e5ea2fd
https://doi.org/10.1007/978-3-031-27051-2_25
https://doi.org/10.1007/978-3-031-27051-2_25
Autor:
N. R. Aravind, C. R. Subramanian
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 1, Pp 153-166 (2021)
We show that the intersection dimension of graphs with respect to several hereditary properties can be bounded as a function of the maximum degree. As an interesting special case, we show that the circular dimension of a graph with maximum degree Δ
Autor:
Juho Lauri, Neeldhara Misra, Akanksha Agrawal, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare, I. Vinod Reddy, N. R. Aravind
Publikováno v:
Theoretical Computer Science. 835:58-81
In a vertex-colored graph, an edge is happy if its endpoints have the same color. Similarly, a vertex is happy if all its incident edges are happy. Motivated by the computation of homophily in social networks, we consider the algorithmic aspects of t
Autor:
Viresh Patel, Rémi de Joannis de Verclos, Ross J. Kang, N. R. Aravind, Wouter Cames van Batenburg, Stijn Cambie
Publikováno v:
The Electronic Journal of Combinatorics, 28, 2, pp. 1-13
The Electronic Journal of Combinatorics, 28, 1-13
The Electronic Journal of Combinatorics, 28, 1-13
Motivated by a recent conjecture of the first author, we prove that every properly coloured triangle-free graph of chromatic number $\chi$ contains a rainbow independent set of size $\lceil\frac12\chi\rceil$. This is sharp up to a factor $2$. This re
Publikováno v:
Indoor and Built Environment. 29:721-729
The major segment for energy consumption is found in industry, transport, agricultural, residential and commercial sector. The main part of the energy consumption in residential and commercial buildings is due to the use of mechanical devices to main
Autor:
Roopam Saxena, N. R. Aravind
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030799861
IWOCA
IWOCA
For a positive integer d, the d-CUT is the problem of deciding if an undirected graph \(G=(V,E)\) has a nontrivial bipartition (A, B) of V such that every vertex in A (resp. B) has at most d neighbors in B (resp. A). When \(d=1\), this is the MATCHIN
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::42dbfcfef82312be3e996fcb3926dc53
https://doi.org/10.1007/978-3-030-79987-8_37
https://doi.org/10.1007/978-3-030-79987-8_37
Autor:
Udit Maniyar, N. R. Aravind
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030392185
We introduce and study a new graph representation where vertices are embedded in three or more dimensions, and in which the edges are drawn on the projections onto the axis-parallel planes. We show that the complete graph on $n$ vertices has a repres
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::22402f9416461a1808a5382301087bd6
https://doi.org/10.1007/978-3-030-39219-2_36
https://doi.org/10.1007/978-3-030-39219-2_36
Publikováno v:
SIAM Journal on Discrete Mathematics. 31:542-561
For a graph $H$, the $H$-free Edge Deletion problem asks whether there exist at most $k$ edges whose deletion from the input graph $G$ results in a graph without any induced copy of $H$. $H$-free Edge Completion and $H$-free Edge Editing are defined