Zobrazeno 1 - 10
of 925
pro vyhledávání: '"A. Rajendraprasad"'
We show that every planar triangulation on $n$ vertices has a maximal independent set of size at most $n/3$. This affirms a conjecture by Botler, Fernandes and Guti\'errez [Electron.\ J.\ Comb., 2024], which in turn would follow if an open question o
Externí odkaz:
http://arxiv.org/abs/2410.21808
Autor:
Ardra, P. S., Babu, Jasine, Kashyap, Kritika, Krithika, R., Pallathumadam, Sreejith K., Rajendraprasad, Deepak
Color-constrained subgraph problems are those where we are given an edge-colored (directed or undirected) graph and the task is to find a specific type of subgraph, like a spanning tree, an arborescence, a single-source shortest path tree, a perfect
Externí odkaz:
http://arxiv.org/abs/2403.06580
A dominating set of a graph $G$ is a subset $S$ of its vertices such that each vertex of $G$ not in $S$ has a neighbor in $S$. A face-hitting set of a plane graph $G$ is a set $T$ of vertices in $G$ such that every face of $G$ contains at least one v
Externí odkaz:
http://arxiv.org/abs/2403.02808
Autor:
Mrugank Narvekar, Bharatkumar Rajendraprasad Dave, Ajay Krishnan, Devanand Degulmadi, Shivanand Mayi, Ravi Ranjan Rai, Mirant Dave, Charde Pranav, Abhijith Anil, Rohan Killekar, Panthackel Mikeson, Kishor Murkute
Publikováno v:
Asian Spine Journal, Vol 18, Iss 5, Pp 647-653 (2024)
Study Design Retrospective observational study. Purpose This study aimed to evaluate the utility of cervical dynamic magnetic resonance imaging (dMRI) in the assessment of cervical canal stenosis. Overview of Literature Cervical spondylotic myelopath
Externí odkaz:
https://doaj.org/article/7f771d2682e34102b96646c524f9d1e5
Publikováno v:
Indian Journal of Pathology and Microbiology, Vol 67, Iss 3, Pp 665-668 (2024)
Endocardial fibroelastosis is characterized by proliferation of both elastic and collagenous fibers within the endocardium, causing diffuse or localized thickening. A four-and-a-half-month-old baby was admitted to a local hospital, with a history of
Externí odkaz:
https://doaj.org/article/d8f216921d6b44f4904ccd1ed31be9a2
Autor:
Narvekar, Mrugank1 (AUTHOR), Dave, Bharatkumar Rajendraprasad1 (AUTHOR) brd_172@yahoo.com, Krishnan, Ajay1 (AUTHOR), Degulmadi, Devanand1 (AUTHOR), Mayi, Shivanand1 (AUTHOR), Rai, Ravi Ranjan1 (AUTHOR), Dave, Mirant1 (AUTHOR), Pranav, Charde1 (AUTHOR), Anil, Abhijith1 (AUTHOR), Killekar, Rohan1 (AUTHOR), Mikeson, Panthackel1 (AUTHOR), Murkute, Kishor1 (AUTHOR)
Publikováno v:
Asian Spine Journal. Oct2024, Vol. 18 Issue 5, p647-653. 7p.
A $k$-bend path is a non-self-intersecting polyline in the plane made of at most $k+1$ axis-parallel line segments. B$_k$-VPG is the class of graphs which can be represented as intersection graphs of $k$-bend paths in the same plane. In this paper, w
Externí odkaz:
http://arxiv.org/abs/2209.08269
We show that every simple planar near-triangulation with minimum degree at least three contains two disjoint total dominating sets. The class includes all simple planar triangulations other than the triangle. This affirms a conjecture of Goddard and
Externí odkaz:
http://arxiv.org/abs/2205.06464
Publikováno v:
In European Polymer Journal 11 December 2024 221
Publikováno v:
In Reactive and Functional Polymers December 2024 205