Zobrazeno 1 - 10
of 730
pro vyhledávání: '"Arunkumar. G"'
Let A be a graph type and B an equivalence relation on a group $G$. Let $[g]$ be the equivalence class of $g$ with respect to the equivalence relation B. The B superA graph of $G$ is an undirected graph whose vertex set is $G$ and two distinct vertic
Externí odkaz:
http://arxiv.org/abs/2408.00390
Autor:
Ganeshbabu, R., Arunkumar, G.
Fix $m \in \mathbb N$. A new generalization of the $H$-join operation of a family of graphs $\{G_1, G_2, \dots, G_k\}$ constrained by indexing maps $I_1,I_2,\dots,I_k$ is introduced as $H_m$-join of graphs, where the maps $I_i:V(G_i)$ to $[m]$. Vario
Externí odkaz:
http://arxiv.org/abs/2402.10557
Stanley's Tree Isomorphism Conjecture posits that the chromatic symmetric function can distinguish non-isomorphic trees. While already established for caterpillars and other subclasses of trees, we prove the conjecture's validity for a new class of t
Externí odkaz:
http://arxiv.org/abs/2307.02234
Publikováno v:
European Journal of Rhinology and Allergy, Vol 7, Iss 2, Pp 76-80 (2024)
Nasopharyngeal angiofbroma is a relatively rare tumor, which is locally aggressive and histologically benign with transformation to a malignant sarcomatous form in a previously irradiated candidate. Here we are reporting the second known case accordi
Externí odkaz:
https://doaj.org/article/397ac0f48725465aafbc9ee445eb06ac
Topological indices are parameters associated with graphs that have many applications in different areas such as mathematical chemistry. Among various topological indices, the Wiener index is classical \cite{w}. In this paper, we prove a formula for
Externí odkaz:
http://arxiv.org/abs/2303.12491
The zero-divisor graph of a finite commutative ring with unity is the graph whose vertex set is the set of zero-divisors in the ring, with $a$ and $b$ adjacent if $ab=0$. We show that the class of zero-divisor graphs is universal, in the sense that e
Externí odkaz:
http://arxiv.org/abs/2207.11741
Publikováno v:
In Discrete Applied Mathematics 31 December 2024 359:371-382
Let $G$ be a finite group. A number of graphs with the vertex set $G$ have been studied, including the power graph, enhanced power graph, and commuting graph. These graphs form a hierarchy under the inclusion of edge sets, and it is useful to study t
Externí odkaz:
http://arxiv.org/abs/2112.02395
Autor:
Rani, Shushma, Arunkumar, G.
Publikováno v:
In Journal of Combinatorial Theory, Series A May 2024 204