Zobrazeno 1 - 10
of 201
pro vyhledávání: '"G. Indulal"'
Autor:
G. Indulal, R. Balakrishnan
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 13, Iss 3, Pp 230-234 (2016)
The D-eigenvalues μ1,μ2,…,μn of a graph G of order n are the eigenvalues of its distance matrix D and form the distance spectrum or D-spectrum of G denoted by SpecD(G). Let G1 and G2 be two regular graphs. The Indu–Bala product of G1 and G2 is
Externí odkaz:
https://doaj.org/article/0097a01b47194582962afff9664fc1d7
Autor:
G. Indulal, Dragan Stevanović
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 12, Iss 2, Pp 186-192 (2015)
Let G be a connected graph with a distance matrix D. The D-eigenvalues {μ1,μ2,…,…,μp} of G are the eigenvalues of D and form the distance spectrum or D-spectrum of G. Given two graphs G with vertex set {v1,v2,……,vp} and H, the corona G∘H
Externí odkaz:
https://doaj.org/article/1ed2561a32734444b1cfb5c765e6f654
Autor:
L. Alex, G. Indulal
Publikováno v:
Journal of Computer Science and Applied Mathematics. 3:37-57
Wiener index is the first among the long list of topological indices which was used to correlate structural and chemical properties of molecular graphs. In \cite{Eli} M. Eliasi, B. Taeri defined four new sums of graphs based on the subdivision of edg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a1a39e2c1e00ee318820bf7a50455ad
https://doi.org/10.37418/jcsam.3.2.1
https://doi.org/10.37418/jcsam.3.2.1
Autor:
Alex, Liju1 lijualex@bcmcollege.ac.in, Mulloor, John Joy1 johnjoy.mulloor@gmail.com, Indulal, G.2 indulalgopal@gmail.com
Publikováno v:
Proyecciones - Journal of Mathematics. Aug2024, Vol. 43 Issue 4, p947-964. 18p.
Publikováno v:
Journal of Mathematical Chemistry. 59:1603-1609
The paper is concerned with the PI index of graphs. Let G be a graph and e its edge. If $$PI(G)=PI(G-e)$$ , then e is said to be a PI-invariant edge of G. Bipartite graphs have no PI-invariant edges. A general class of non-bipartite graphs is constru
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::903b10f5bb572371f0bd60adba7c2773
https://doi.org/10.1007/s10910-021-01255-1
https://doi.org/10.1007/s10910-021-01255-1
Publikováno v:
Indian Journal of Pure and Applied Mathematics. 52:304-311
The anti-Gallai graph $$\Delta (G)$$ of a graph G, has the edges of G as its vertices and two distinct edges are adjacent in $$\Delta (G)$$ if they lie on a triangle in G. In this paper we characterize the graphs whose anti-Gallai graph has only one
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2cba09e54fe19582ee8aaba88b8c2934
https://doi.org/10.1007/s13226-021-00066-z
https://doi.org/10.1007/s13226-021-00066-z
Autor:
Deena C. Scaria, G. Indulal
Publikováno v:
Indian Journal of Pure and Applied Mathematics. 52:274-280
In this paper we define some generalised graphs related to the cycle $$C_n$$ namely M(n, k), T(n, k, t) , N(n, k, t), D(n, k, t, m), C(n, k, t), PC(n, k, t) and CC(n, k, t) , obtain their adjacency spectrum and thus adding them to the classes of grap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::09831dde128ff0d961df5243c5d536dc
https://doi.org/10.1007/s13226-021-00077-w
https://doi.org/10.1007/s13226-021-00077-w
Publikováno v:
Indian Journal of Pure and Applied Mathematics. 51:1829-1841
The Gallai graph Γ(G) of a graph G, has the edges of G as its vertices and two distinct vertices are adjacent in Γ(G) if they are adjacent edges in G, but do not lie on a triangle. In this paper we find the adjacency spectrum of Gallai graph of som
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bf1afd8ceea1c938aff93d9623cfda14
https://doi.org/10.1007/s13226-020-0499-0
https://doi.org/10.1007/s13226-020-0499-0
Autor:
Mary George, G. Indulal
Publikováno v:
Journal of Advanced Mathematics and Applications. 6:3-6
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eef38d80dd4f6adee48751e5966e9ec4
https://doi.org/10.1166/jama.2017.1121
https://doi.org/10.1166/jama.2017.1121
Autor:
R. Balakrishnan, G. Indulal
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 13, Iss 3, Pp 230-234 (2016)
The D -eigenvalues μ 1 , μ 2 , … , μ n of a graph G of order n are the eigenvalues of its distance matrix D and form the distance spectrum or D -spectrum of G denoted by S p e c D ( G ) . Let G 1 and G 2 be two regular graphs. The Indu–Bala pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f99633f608abfcff9f099bd3312b1f72
https://doi.org/10.1016/j.akcej.2016.06.012
https://doi.org/10.1016/j.akcej.2016.06.012