M. Nagar

collaborators

4 papers

math.CO2026

On Spectra of $T$ -Gain Digraphs

Shivani Tushar Parab, Tarkeshwar Singh, Mukesh Kumar Nagar

A $\mathbb{T}$-gain digraph is a directed graph with complex unit gains on its arcs, allowing for no restrictions on oppositely directed arcs. This framework unifies various grap…

math.CO2023

The maximum four point condition matrix of a tree

Ali Azimi, Rakesh Jana, Mukesh Kumar Nagar +1

The Four point condition (4PC henceforth) is a well known condition characterising distances in trees $T$ . Let $w, x, y, z$ be four vertices in $T…

math.CO2023

Inequalities among two rowed immanants of the $q$ -Laplacian of Trees and Odd height peaks in generalized Dyck paths

Mukesh Kumar Nagar, Arbind Kumar Lal, Sivaramakrishnan Sivasubramanian

Let $T$ be a tree on $n$ vertices and let $L_{q}^{T}$ be the $q$ -analogue of its Laplacian. For a partition $λ ⊢ n$ , let the normalized immanant of $L_{q}^{T}$ indexed by $λ$ be denote…

math.CO2023

Laplacian Immanantal Polynomials of a Bipartite Graph and Graph Shift Operation

Mukesh Kumar Nagar

Let $G$ be a bipartite graph on $n$ vertices with the Laplacian matrix $L_{G}$ . When $G$ is a tree, inequalities involving coefficients of immanantal polynomials of $L_{G}$ are known a…

On Spectra of T-Gain Digraphs

The maximum four point condition matrix of a tree

Inequalities among two rowed immanants of the q-Laplacian of Trees and Odd height peaks in generalized Dyck paths

Laplacian Immanantal Polynomials of a Bipartite Graph and Graph Shift Operation

On Spectra of $T$ -Gain Digraphs

Inequalities among two rowed immanants of the $q$ -Laplacian of Trees and Odd height peaks in generalized Dyck paths