Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Ganeshbabu, R."'
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
Autor:
GaneshBabu, R., Amudha, V.
Publikováno v:
Procedia Computer Science; 2016, Vol. 87, p258-263, 6p
