Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Bikash Bhattacharjya"'
Autor:
Monu Kadyan, Bikash Bhattacharjya
Publikováno v:
Theory and Applications of Graphs, Vol 10, Iss 1, Pp 1-25 (2023)
A mixed graph is called \emph{second kind hermitian integral} (\emph{HS-integral}) if the eigenvalues of its Hermitian-adjacency matrix of the second kind are integers. A mixed graph is called \emph{Eisenstein integral} if the eigenvalues of its (0,
Externí odkaz:
https://doaj.org/article/89419f0c11df432794a23d046bf52a6e
Autor:
Deepak Sehrawat, Bikash Bhattacharjya
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 2, Pp 235-255 (2021)
In this paper we find the number of different signatures of P(3, 1),P(5, 1) and P(7, 1) up to switching isomorphism, where P(n, k) denotes the generalised Petersen graph, 2k n. We also count the number of non-isomorphic signatures on P(2n + 1, 1) of
Externí odkaz:
https://doaj.org/article/705b5dad6f444b84a1f7a5ff2a161793
Autor:
Deepak Sehrawat, Bikash Bhattacharjya
Publikováno v:
Theory and Applications of Graphs, Vol 9, Iss 1 (2022)
For $m \geq 3$ and $n \geq 1$, the $m$-cycle \textit{book graph} $B(m,n)$ consists of $n$ copies of the cycle $C_m$ with one common edge. In this paper, we prove that (a) the number of switching non-isomorphic signed $B(m,n)$ is $n+1$, and (b) the ch
Externí odkaz:
https://doaj.org/article/ca63435518fb4c94a4c060682984a561
Autor:
Bikash Bhattacharjya, Deepak Sehrawat
Publikováno v:
Advances and Applications in Discrete Mathematics. 24:129-142
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::21323405a294037b0beeb161e0ac52d7
https://doi.org/10.17654/dm024020129
https://doi.org/10.17654/dm024020129
Autor:
Bikash Bhattacharjya, Monu Kadyan
Publikováno v:
Discrete Mathematics. 346:113142
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::767b736faef541b469da2ec8553dbf45
https://doi.org/10.1016/j.disc.2022.113142
https://doi.org/10.1016/j.disc.2022.113142
Autor:
Monu Kadyan, Bikash Bhattacharjya
Publikováno v:
The Electronic Journal of Combinatorics. 28
A mixed graph is said to be integral if all the eigenvalues of its Hermitian adjacency matrix are integer. Let $\Gamma$ be an abelian group. The mixed Cayley graph $Cay(\Gamma,S)$ is a mixed graph on the vertex set $\Gamma$ and edge set $\left\{ (a,b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::512ccdb08c8012f914f145fb855ecc7b
https://doi.org/10.37236/10534
https://doi.org/10.37236/10534
Autor:
Bikash Bhattacharjya, Monu Kadyan
A mixed graph is called \emph{second kind hermitian integral}(or \emph{HS-integral}) if the eigenvalues of its Hermitian-adjacency matrix of second kind are integers. A mixed graph is called \emph{Eisenstein integral} if the eigenvalues of its (0, 1)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a5d979b16f019746a5d13f13f6b57bef
Autor:
Hiranmoy Pal, Bikash Bhattacharjya
Publikováno v:
Electronic Notes in Discrete Mathematics. 53:319-329
Let G be a graph with adjacency matrix A. The transition matrix corresponding to G is defined by H ( t ) : = exp ( i t A ) , t ∈ R . The graph G is said to have perfect state transfer (PST) from a vertex u to another vertex v, if there exist τ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9842211d9a3ff517fc8b8dbb1c86db00
https://doi.org/10.1016/j.endm.2016.05.027
https://doi.org/10.1016/j.endm.2016.05.027
Autor:
Hiranmoy Pal, Bikash Bhattacharjya
Publikováno v:
Discrete Mathematics. 339:831-838
Perfect state transfer is significant in quantum communication networks. There are very few graphs known to have this property. So, it is useful to find some new graphs having perfect state transfer. A good way to construct new graphs is by forming N
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c945d8959db2c3b149fc902d3888ae79
https://doi.org/10.1016/j.disc.2015.10.027
https://doi.org/10.1016/j.disc.2015.10.027
Autor:
Deepak Sehrawat, Bikash Bhattacharjya
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 9, Iss 2, Pp 235-255 (2021)
In this paper we find the number of different signatures of P(3, 1),P(5, 1) and P(7, 1) up to switching isomorphism, where P(n, k) denotes the generalised Petersen graph, 2k n. We also count the number of non-isomorphic signatures on P(2n + 1, 1) of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2dd5b59d1cddbce78e3fe4ae969f28a6