Zobrazeno 1 - 10
of 19
pro vyhledávání: '"central edge join"'
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
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:
K, Jahfar T, A V, Chithra
In this paper, we compute normalized Laplacian spectra of central graph of a regular graph, central vertex join and central edge join of two regular graphs. Also, we determine their Kemeny's constant and degree Kirchhoff index.
Externí odkaz:
http://arxiv.org/abs/2105.05368
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
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:
A. V. Chithra, Jahfar T K
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://explore.openaire.eu/search/publication?articleId=doi_dedup___::aec95759b4dfbf31bfd330de98e64c9a
https://www.aimspress.com/article/10.3934/math.2020461/fulltext.html
https://www.aimspress.com/article/10.3934/math.2020461/fulltext.html
Autor:
T. Haritha, A. V. Chithra
Publikováno v:
Ricerche di Matematica.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::731afcacd06f2daaa0c4592af76f9b46
https://doi.org/10.1007/s11587-022-00721-5
https://doi.org/10.1007/s11587-022-00721-5
Autor:
Ashokan, Anjitha, A V, Chithra
The eccentricity matrix of a simple connected graph is derived from its distance matrix by preserving the largest non-zero distance in each row and column, while the other entries are set to zero. This article examines the $\epsilon$-spectrum, $\epsi
Externí odkaz:
http://arxiv.org/abs/2411.12599
Autor:
Manjunatha, B. J.1,2 (AUTHOR), Rakshith, B. R.3 (AUTHOR), Prakasha, K. N.1 (AUTHOR), Sayinath Udupa, N. V.3 (AUTHOR)
Publikováno v:
International Journal of Mathematics & Mathematical Sciences. 5/27/2024, Vol. 2024, p1-8. 8p.