Zobrazeno 1 - 10
of 973
pro vyhledávání: '"Join of two graphs"'
Autor:
T, Haritha, A V, Chithra
The central graph $C(G)$ of a graph $G$ is the graph obtained by inserting a new vertex into each edge of $G$ exactly once and joining all the non-adjacent vertices in $G$. Let $G_1$ and $G_2$ be two vertex disjoint graphs. The central vertex join of
Externí odkaz:
http://arxiv.org/abs/2404.06317
Autor:
Jianhua Li1 lijh129@163.com, Qun Liu2 liuqun@fudan.edu.cn
Publikováno v:
IAENG International Journal of Applied Mathematics. Mar2023, Vol. 53 Issue 1, p369-373. 5p.
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:
Mohamed R. Zeen El Deen, Nora A. Omar
Publikováno v:
Journal of the Egyptian Mathematical Society, Vol 28, Iss 1, Pp 1-20 (2020)
Abstract In this paper, we investigated the edge even graceful labeling property of the join of two graphs. A function f is called an edge even graceful labeling of a graph G=(V(G),E(G)) with p=|V(G)| vertices and q=|E(G)| edges if f:E(G)→{2,4,...,
Externí odkaz:
https://doaj.org/article/6628e5b4abc3489da7615955af4a4dca
Autor:
Alikhani, Saeid, Soltani, Samaneh
The distinguishing number (index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (edge labeling) with $d$ labels that is preserved only by a trivial automorphism. In this paper we study the distinguishin
Externí odkaz:
http://arxiv.org/abs/1603.04005
Autor:
Jahfar T K, Chithra A V
Publikováno v:
AIMS Mathematics, Vol 5, Iss 6, Pp 7214-7233 (2020)
The central graph $C(G)$ of a graph $G$ is obtained by sub dividing each edge of $G$ exactly once and joining all the nonadjacent vertices in $G$. In this paper, we compute the adjacency, Laplacian and signless Laplacian spectra of central graph of a
Externí odkaz:
https://doaj.org/article/0f55cc8b22d348dfb1e061025ed43419
Autor:
Coronado, David1 dcoronado@usb.ve, Quiroz, Domingo2 daquiroz@espol.edu.ec
Publikováno v:
International Journal of Mathematics & Computer Science. 2020, Vol. 15 Issue 2, p627-632. 6p.
Autor:
Liu, Xiaogang, Zhang, Zuhe
Publikováno v:
The Bulletin of the Malaysian Mathematical Society 42 (2019) 15--31
The subdivision graph $\mathcal{S}(G)$ of a graph $G$ is the graph obtained by inserting a new vertex into every edge of $G$. Let $G_1$ and $G_2$ be two vertex disjoint graphs. The \emph{subdivision-vertex join} of $G_1$ and $G_2$, denoted by $G_1\do
Externí odkaz:
http://arxiv.org/abs/1212.0619
Autor:
Saeid Alikhani, Samaneh Soltani
Publikováno v:
Mathematics Interdisciplinary Research, Vol 4, Iss 2, Pp 239-251 (2019)
The distinguishing number (index) D(G) (D'(G)) of a graph G is the least integer d such that G has an vertex labeling (edge labeling) with d labels that is preserved only by a trivial automorphism. In this paper we study the distinguishing number and
Externí odkaz:
https://doaj.org/article/66886be0fde64fad9c0d8f33486f5511