Zobrazeno 1 - 7
of 7
pro vyhledávání: '"K. M., Niranjan"'
Publikováno v:
Journal of Advanced Research in Dynamical and Control Systems. 12:83-89
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::255074784cdf4ee9fde9bba19b22533a
https://doi.org/10.5373/jardcs/v12i8/20202449
https://doi.org/10.5373/jardcs/v12i8/20202449
Publikováno v:
Advances in Mathematics: Scientific Journal. 9:2121-2135
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2bad610781ae3358f832782c17474d43
https://doi.org/10.37418/amsj.9.4.72
https://doi.org/10.37418/amsj.9.4.72
Publikováno v:
Malaya Journal of Matematik. 8:2190-2193
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a405529b5e70b02c3b29f690982aa07b
https://doi.org/10.26637/mjm0804/0148
https://doi.org/10.26637/mjm0804/0148
Publikováno v:
South East Asian Journal of Mathematics & Mathematical Sciences; 2020, Vol. 16 Issue 1, p171-176, 6p
Publikováno v:
Journal of Scientific Research. 5:295-299
The advent of graph theory has played a prominent role in wide variety of engineering applications. Minimization of crossing numbers in graphs optimizes its use in many applications. In this paper, we establish the necessary and sufficient condition
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c55cf78300d4fe6dea654287ea71192
https://doi.org/10.3329/jsr.v5i2.11019
https://doi.org/10.3329/jsr.v5i2.11019
Publikováno v:
Journal of Scientific Research. 2:257-263
We establish here necessary and sufficient conditions for quasi-total graphs to have crossing numbers k ( k = 1, 2 or 3). Keywords : Quasi-total; Crossing numbers. © 2010 JSR Publications. ISSN: 2070-0237 (Print); 2070-0245 (Online). All rights rese
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::51079aad50f5cd164d63d4dfb8b6f292
https://doi.org/10.3329/jsr.v2i2.3527
https://doi.org/10.3329/jsr.v2i2.3527
Autor:
V. R. Kulli, K. M. Niranjan
Publikováno v:
Journal of Scientific Research. 1:551-557
We present here characterizations of graphs whose semi total (point) graphs are outerplanar and k-minimally nonouterplanar (k = 1, 2 or 3).Keywords: Semi total (Point) graph; Minimally nonouterplanarity; Outerplanar; Block.© 2009 JSR Publications. I
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ae5ee0d872656e4e527f40919e9619d
https://doi.org/10.3329/jsr.v1i3.2578
https://doi.org/10.3329/jsr.v1i3.2578