Author pages are created from data sourced from our academic publisher partnerships and public sources.

Publications Influence

Share This Author

Spanning trees and spanning Eulerian subgraphs with small degrees

- M. Hasanvand
- Mathematics, Computer Science
- Discret. Math.
- 6 August 2015

Liu and Xu (1998) and Ellingham, Nam and Voss (2002) independently showed that every k -edge-connected simple graph G has a spanning tree T such that for each vertex v , d T ( v ) ? ? d ( v ) k ? + 2… Expand

11- PDF

Factors and Connected Factors in Tough Graphs with High Isolated Toughness

- M. Hasanvand
- Mathematics
- 30 December 2018

In this paper, we show that every $1$-tough graph with order and isolated toughness at least $r+1$ has a factor whose degrees are $r$, except for at most one vertex with degree $r+1$. Using this… Expand

1- PDF

Packing spanning partition-connected subgraphs with small degrees

- M. Hasanvand
- Mathematics
- 31 May 2018

Let $G$ be a graph with $X\subseteq V(G)$ and let $l$ be an intersecting supermodular subadditive integer-valued function on subsets of $V(G)$. The graph $G$ is said to be $l$-partition-connected, if… Expand

1- PDF

Modulo Orientations with Bounded Out-Degrees and Modulo Factors with Bounded Degrees

- M. Hasanvand
- Mathematics
- 22 February 2017

Let G be a graph, let k be a positive integer, and let p : V (G) → Zk be a mapping with |E(G)| k ≡ ∑ v∈V (G) p(v). In this paper, we show that if G is (3k − 3)-edge-connected, then G has an… Expand

2- PDF

The square chromatic number of the torus

- A. G. Chegini, M. Hasanvand, E. Mahmoodian, F. Moazami
- Computer Science, Mathematics
- Discret. Math.
- 6 February 2016

TLDR

C O ] 2 9 M ay 2 01 9 Bipartite partition-connected factors with small degrees

- M. Hasanvand
- 2019

In this paper, we show that every 2m-partition-connected graph G has a bipartite m-partitionconnected factor H such that for each vertex v, dH(v) ≤ ⌈ 3 4 dG(v)⌉. A graph H is said to be… Expand

Packing spanning rigid subgraphs with restricted degrees

- M. Hasanvand
- Mathematics
- 19 June 2018

Let $G$ be a graph and let $l$ be an integer-valued function on subsets of $V(G)$. The graph $G$ is said to be $l$-partition-connected, if for every partition $P$ of $V(G)$, $e_G(P)\ge \sum_{A\in P}… Expand

NUMERICAL SOLUTION OF KINEMATIC WAVE EQUATION USING DIFFERENTIAL QUADRATURE METHOD

- M. Hasanvand, M. Hashemi
- Mathematics
- 2011

Modulo $k$-Orientations and Tutte's $3$-Flow Conjecture in Graphs with Many Edge-Disjoint Spanning Trees

- M. Hasanvand
- Mathematics
- 7 November 2016

Let $k$ be an integer, $k\ge 3$, and let $Z_k$ be the cyclic group of order $k$. Take $\lambda_k\in [k+2, \infty)$ to be the smallest integer such that for every $\lambda_k$-edge-connected graph $G$… Expand

Spanning closed walks with bounded maximum degrees of graphs on surfaces

- M. Hasanvand
- Mathematics
- 30 November 2017

Gao and Richter (1994) showed that every $3$-connected graph which embeds on the plane or the projective plane has a spanning closed walk meeting each vertex at most $2$ times. Brunet, Ellingham,… Expand

...

1

2

...