K. Das

activity

20172023

most citedMore results on the distance (signless) Laplacian eigenvalues of graphs

9 citations · 9 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2023

On Zagreb indices of graphs

Batmend Horoldagva, Kinkar Chandra Das

Let $G_{n}$ be the set of class of graphs of order $n$ . The first Zagreb index $M_{1} (G)$ is equal to the sum of squares of the degrees of the vertices, and the second Zagre…

math.CO2021

On the Number of $k -$ Matchings in Graphs

Kinkar Ch. Das, Ali Ghalavand, Ali Reza Ashrafi

Suppose $G$ is a undirected simple graph. A $k -$ subset of edges in $G$ without common vertices is called a $k -$ matching and the number of such subsets is denoted by $p (G, k)$ . The a…

math.CO2017

Open problem on $σ$ -invariant

Kinkar Ch. Das, Seyed Ahmad Mojallal

Let $G$ be a graph of order $n$ with $m$ edges. Also let $μ_{1} \geq μ_{2} \geq \dots \geq μ_{n - 1} \geq μ_{n} = 0$ be the Laplacian eigenvalues of graph $G$ and let $σ = σ (G)$ $(1 \leq σ \leq n)$ …

math.CO2017★ 9 cited

More results on the distance (signless) Laplacian eigenvalues of graphs

Jie Xue, Huiqiu Lin, Kinkar Ch. Das +1

Let $G$ be a connected graph with vertex set $V (G)$ and edge set $E (G)$ . Let $T r (G)$ be the diagonal matrix of vertex transmissions of $G$ and $D (G)$ be the distance matrix of $G$ .…

On Zagreb indices of graphs

On the Number of k−Matchings in Graphs

Open problem on σ-invariant

More results on the distance (signless) Laplacian eigenvalues of graphs

On the Number of $k -$ Matchings in Graphs

Open problem on $σ$ -invariant