Discrete Mathematics and Combinatorics, Mathematics
4
Scopus Publications
15
Scholar Citations
2
Scholar h-index
Scopus Publications
Generalized distance spectral radius of some t-partitioned transmission regular graphs Aditi Howlader, Pratima Panigrahi Asian European Journal of Mathematics, 2025 Let [Formula: see text] be an [Formula: see text]-vertex connected graph with the distance matrix [Formula: see text] and the diagonal matrix of transmissions [Formula: see text]. The generalized distance matrix of a connected graph [Formula: see text] is [Formula: see text], where [Formula: see text], [Formula: see text]. Through this matrix one can study distance, distance Laplacian, distance signless Laplacian, and [Formula: see text]- spectra of [Formula: see text] in a unified way. A simple connected graph [Formula: see text] is called [Formula: see text]-partitioned transmission regular if the vertex set of [Formula: see text] can be partitioned as [Formula: see text] such that for any pair of indices [Formula: see text] (not necessarily distinct) in [Formula: see text] and [Formula: see text], [Formula: see text] is constant. In this paper, for the spider graph [Formula: see text] and the radar graph [Formula: see text], we find matrices of order [Formula: see text] (quotient matrices) corresponding to [Formula: see text] and [Formula: see text] such that the largest eigenvalues of these matrices are generalized distance spectral radius of [Formula: see text] and [Formula: see text], respectively. Moreover, we determine the full [Formula: see text]-spectrum of [Formula: see text] and [Formula: see text] (wheel graph).
On the distance spectrum of generalized balanced trees Aditi Howlader, Pratima Panigrahi Linear and Multilinear Algebra, 2024 For positive integers m1,m2,…,mh, a generalized balanced tree T(m1,m2,…,mh) is a rooted tree of height h such that every vertex of depth i has mi+1 children, 0≤i≤ h−1. The distance matrix D(G) of a simple connected graph G of order n is an n×n matrix whose (i,j)th entry is the distance between ith and jth vertices. A connected graph G is called a k-partitioned transmission regular graph if there exists a vertex partition {V1,V2,…,Vk} of G so that for 1≤i,j≤k, and x∈Vi, ∑y∈Vjd(x,y) is a constant. Here we show that T(m1,m2,…,mh) is an (h+1)-partitioned transmission regular graph. We find an (h+1)×(h+1) matrix whose largest eigenvalue is the distance spectral radius of T(m1,m2,…,mh). We obtain the characteristic polynomial of D(T(m1,m2,…,mh)) in terms of that of the smaller matrices and give an idea to find the full spectrum. Moreover, we get that D(T(m1,m2,…,mh)) has −2 an eigenvalue with multiplicity at least m1⋯mh−1(mh−1) and −(mh+2)±mh(mh+4) as eigenvalues with multiplicity at least m1⋯mh−2(mh−1−1).
Generalized distance spectral radius of some -partitioned transmission regular graphs A Howlader, P Panigrahi Asian-European Journal of Mathematics 18 (09), 2550027 , 2025 2025
The full P-vertex problem for unicyclic graphs A Howlader, PR Raickwade, KC Sivakumar Linear Algebra and its Applications 713, 74-89 , 2025 2025 Citations: 1
On the distance spectrum of generalized balanced trees A Howlader, P Panigrahi Linear and Multilinear Algebra 72 (9), 1497-1522 , 2024 2024
On the distance spectrum of minimal cages and associated distance biregular graphs A Howlader, P Panigrahi Linear Algebra and Its Applications 636, 115-133 , 2022 2022 Citations: 9
Distance and Generalized Distance Spectra of Some Graphs A Howlader IIT Kharagpur , 2022 2022 Citations: 2
Distance and distance signless Laplacian spectrum of some k-partitioned transmission regular graphs A Howlader, P Panigrahi Indian J Discrete Math 6 (2), 141-163 , 2020 2020 Citations: 3
MOST CITED SCHOLAR PUBLICATIONS
On the distance spectrum of minimal cages and associated distance biregular graphs A Howlader, P Panigrahi Linear Algebra and Its Applications 636, 115-133 , 2022 2022 Citations: 9
Distance and distance signless Laplacian spectrum of some k-partitioned transmission regular graphs A Howlader, P Panigrahi Indian J Discrete Math 6 (2), 141-163 , 2020 2020 Citations: 3
Distance and Generalized Distance Spectra of Some Graphs A Howlader IIT Kharagpur , 2022 2022 Citations: 2
The full P-vertex problem for unicyclic graphs A Howlader, PR Raickwade, KC Sivakumar Linear Algebra and its Applications 713, 74-89 , 2025 2025 Citations: 1
Generalized distance spectral radius of some -partitioned transmission regular graphs A Howlader, P Panigrahi Asian-European Journal of Mathematics 18 (09), 2550027 , 2025 2025
On the distance spectrum of generalized balanced trees A Howlader, P Panigrahi Linear and Multilinear Algebra 72 (9), 1497-1522 , 2024 2024