The following pages link to Ardeshir Dolati (Q426847):
Displayed 13 items.
- The tight upper bound for the number of matchings of tricyclic graphs (Q426849) (← links)
- On the number of independent sets in cycle-separated tricyclic graphs (Q552339) (← links)
- Szeged index, edge Szeged index, and semi-star trees (Q972322) (← links)
- On the upward embedding on the torus (Q1010987) (← links)
- A characterization of horoidal digraphs (Q1698749) (← links)
- Gomory Hu tree and pendant pairs of a symmetric submodular system (Q1698751) (← links)
- Inverse multi-objective shortest pPath problem under the bottleneck type weighted Hamming distance (Q1698754) (← links)
- Symmetric submodular system: contractions and Gomory-Hu tree (Q2304523) (← links)
- Inverse generalized minimum cost flow problem under the Hamming distances (Q2314066) (← links)
- On the sphericity testing of single source digraphs (Q2483398) (← links)
- Sharp bounds for the number of matchings in generalized-theta-graphs (Q2866420) (← links)
- Some Results about the Contractions and the Pendant Pairs of a Submodular System (Q5241673) (← links)
- On a class of distributions generated by stochastic mixture of the extreme order statistics of a sample of size two (Q6316914) (← links)