Zobrazeno 1 - 10
of 94
pro vyhledávání: '"Sunitha, M S"'
Autor:
Nair, Kavya R., Sunitha, M. S.
This paper introduces the concept of compliant vertices and compliant graphs, with a focus on the total domination degree (TDD) of a vertex in compliant graphs. The TDD is systematically calculated for various graph classes, including path graphs, cy
Externí odkaz:
http://arxiv.org/abs/2409.14117
Autor:
Nair, Kavya. R., Sunitha, M. S.
Topological indices play a vital role in the area of graph theory and fuzzy graph (FG) theory. It has wide applications in the areas such as chemical graph theory, mathematical chemistry, etc. Topological indices produce a numerical parameter associa
Externí odkaz:
http://arxiv.org/abs/2307.10409
Autor:
Nair, Kavya. R., Sunitha, M. S.
The concepts of domination and topological index hold great significance within the realm of graph theory. Therefore, it is pertinent to merge these concepts to derive the domination index of a graph. A novel concept of the domination index is introd
Externí odkaz:
http://arxiv.org/abs/2307.10407
Autor:
V V, Swathi, Sunitha, M S
For a finite group $G$ and for a fixed positive integer $k$, $k\geq 2$, the $k$-power graph of $G$ is an undirected simple graph with vertex set $G$ in which two distinct vertices $x$ and $y$ are adjacent if and only if $x^k=y$ or $y^k=x$. In this pa
Externí odkaz:
http://arxiv.org/abs/2301.10425
Autor:
V V, Swathi, Sunitha, M S
For a finite group $G$ the co-prime graph $\Gamma(G)$ is defined as a graph with vertex set $G$ in which two distinct vertices $x$ and $y$ are adjacent if and only if $gcd(o(x),o(y))=1$ where $o(x)$ and $o(y)$ denote the orders of the elements $x$ an
Externí odkaz:
http://arxiv.org/abs/2301.10422
Autor:
Nair, Kavya. R., Sunitha, M. S.
Fuzzy incidence graphs (FIG) model real world problems efficiently when there is an extra attribute of vertex-edge relationship. The article discusses the operations on Fuzzy incidence graphs. The join, Cartesian product, tensor product, and composit
Externí odkaz:
http://arxiv.org/abs/2210.14092
The power graph $P(G)$ of a finite group $G$ is the undirected simple graph with vertex set $G$, where two elements are adjacent if one is a power of the other. In this paper, the matching numbers of power graphs of finite groups are investigated. We
Externí odkaz:
http://arxiv.org/abs/2107.01157
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
V. V., SWATHI1 swathivv14@gmail.com, SUNITHA, M. S.1 sunitha@nitc.ac.in
Publikováno v:
Transactions on Combinatorics. Jun2025, Vol. 14 Issue 2, p109-116. 8p.
Autor:
Nair, Kavya. R., Sunitha, M. S.
Publikováno v:
Asian-European Journal of Mathematics; Oct2024, Vol. 17 Issue 10, p1-20, 20p