Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Keerthi G. Mirajkar"'
Publikováno v:
Ratio Mathematica, Vol 48, Iss 0 (2023)
Topological index is a numerical representation of structure of graph. They are mainly classified as Distance and Degree based topological indices. In this article Distance based topological indices of Double graphs and Strong Double graphs are calcu
Externí odkaz:
https://doaj.org/article/3a3f8af3932c4938ac6fd235f4f049b7
Publikováno v:
Ratio Mathematica, Vol 48, Iss 0 (2023)
In many real world problems, cactus graphs were considered as models from both algorithmic and theoretical point of view and this graph is a subclass of planar graph and superclass of a tree. In this article, the study has been carried out on some ca
Externí odkaz:
https://doaj.org/article/dd5f1f7937804d75a374149ac8d880c6
Publikováno v:
Ratio Mathematica, Vol 47, Iss 0 (2023)
A graph G is said to be square sum and square difference labeling, if there exists a bijection f from V (G) to {1, 2, 3, ..., (p − 1)} which induces the injective function f ∗ from E(G) to N, defined by f ∗(uv) = f(u)2 + f(v)2 and f ∗(uv) = f
Externí odkaz:
https://doaj.org/article/d5e99cca13834ee99c1a05631f07b277
Autor:
Keerthi G. Mirajkar, Akshata Morajkar
Publikováno v:
Ratio Mathematica, Vol 39, Iss 0, Pp 165-186 (2020)
The relationship between vertices of a graph is always an interesting fact, but the relations of vertices and edges also seeks attention. Motivation of the relationship between vertices and edges of a graph has helped to arise with a set of new degre
Externí odkaz:
https://doaj.org/article/ef21041d2de0449c81266e57403d8bd9
Publikováno v:
Ratio Mathematica, Vol 38, Iss 0, Pp 329-339 (2020)
The line Mycielskian graph of a graph G, denoted by Lμ(G) is defined as the graph obtained from L(G) by adding q+1 new vertices E' = ei' : 1 ≤ i ≤ q and e, then for 1 ≤ i ≤ q , joining ei' to the neighbours of ei and to e. The vertex e is ca
Externí odkaz:
https://doaj.org/article/7b7a2b3b6e194dceaa8738f5afd32b4c
Autor:
Keerthi G. Mirajkar, Akshata Morajkar
Publikováno v:
Acta Universitatis Sapientiae, Informatica. 14:22-34
The concept of first KCD signless Laplacian energy is initiated in this article. Moreover, we determine first KCD signless Laplacian spectrum and first KCD signless Laplacian energy for some class of graphs and their complement.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8a27730f3e3742d3f8344943d7f6d001
https://doi.org/10.2478/ausi-2022-0002
https://doi.org/10.2478/ausi-2022-0002
Publikováno v:
Ratio Mathematica, Vol 41, Iss 0, Pp 207-213 (2021)
The near common neighborhood graph of a graph G, denoted by ncn(G) is defined as the graph on the same vertices of G, two vertices are adjacent in ncn(G), if there is at least one vertex in G not adjacent to both the vertices. In this research paper,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doajarticles::feee8b47cee6f6cb5fbf477dab33bb8f
http://eiris.it/ojs/index.php/ratiomathematica/article/view/626
http://eiris.it/ojs/index.php/ratiomathematica/article/view/626
Publikováno v:
Journal of Computer and Mathematical Sciences. 10:565-573
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07c843e4619303dcf6c50ed19d060292
https://doi.org/10.29055/jcms/1038
https://doi.org/10.29055/jcms/1038
Publikováno v:
International Journal of Mathematics Trends and Technology. 58:131-134
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::67c656e47386ecc0963ab704315b15c5
https://doi.org/10.14445/22315373/ijmtt-v58p519
https://doi.org/10.14445/22315373/ijmtt-v58p519
Publikováno v:
International Journal of Scientific Research in Mathematical and Statistical Sciences. 5:35-39
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9cb07a14f69cd64c14dc632bc7908809
https://doi.org/10.26438/ijsrmss/v5i2.3539
https://doi.org/10.26438/ijsrmss/v5i2.3539