Ajit A. Diwan

collaborators

4 papers

math.CO2025

Graphs with large maximum forcing number

Qianqian Liu, Ajit A. Diwan, Heping Zhang

For a graph $G$ with order $2 n$ and a perfect matching, let $f (G)$ and $F (G)$ denote the minimum and maximum forcing number of $G$ respectively. Then $0 \leq f (G) \leq F (G) \leq n - 1$ .…

math.CO2025

Extremal minimal bipartite matching covered graphs

Amit Kumar Mallik, Ajit A. Diwan, Nishad Kothari

A connected graph, on four or more vertices, is matching covered (aka 1-extendable) if every edge is present in some perfect matching. An ear decomposition theorem exists for bipar…

math.CO2025

Planar cycle-extendable graphs

Aditya Y Dalwadi, Kapil R Shenvi Pause, Ajit A Diwan +1

For most problems pertaining to perfect matchings, one may restrict attention to matching covered graphs - that is, connected nontrivial graphs with the property that each edge bel…

math.CO2024

Cycles of weight divisible by $k$

Ajit A. Diwan

A weighted (directed) graph is a (directed) graph with integer weights assigned to its vertices and edges. The weight of a subgraph is the sum of weights of vertices and edges in t…

Graphs with large maximum forcing number

Extremal minimal bipartite matching covered graphs

Planar cycle-extendable graphs

Cycles of weight divisible by k

Cycles of weight divisible by $k$