1 citations · 4 across the 21 of their papers we have counts for
22 papers
On Path Decomposition Conjecture of Tibor Gallai
Dhananjay P. Mehendale
We settle the Path Decomposition Conjecture (P.D.C.) due to Tibor Gallai for minimally connected graphs, i.e. trees. We use this validity for trees and settle the P. D. C. using in…
A New Algorithm for Multicommodity Flow
Dhananjay P. Mehendale
We propose a new algorithm to obtain max flow for the multicommodity flow. This algorithm utilizes the max-flow min-cut theorem and the well known labeling algorithm due to Ford an…
On Entanglement and Separability
Dhananjay P. Mehendale
We present a necessary and sufficient condition to determine the entanglement status of an arbitrary N-qubit quantum state (may be pure or mixed) represented by the density matrix,…
On Hamilton Decompositions
Dhananjay P. Mehendale
P. J. Kelly conjectured in 1968 that every diregular tournament on (2n+1) points can be decomposed in directed Hamilton circuits [1]. We define so called leading diregular tourname…
On Caccetta-Haggkvist Conjecture
Dhananjay P. Mehendale
We show that we cannot avoid the existence of at least one directed circuit of length less than or equal to (n/r) in a digraph on n vertices with out-degree greater than or equal t…
Ising Problem on Simple Cubic Lattice
Dhananjay P. Mehendale
Simple cubic lattice (SC lattice) can be viewed as plane triangular lattice (PT lattice) by viewing it along its principle diagonal lines. By viewing thus we establish the exact on…