N. Soltani

most citedOn the saturation number of graphs

1 citations · 1 across the 2 of their papers we have counts for

collaborators

4 papers

math.CO2018

On the anti-forcing number of graph powers

Neda Soltani, Saeid Alikhani

Let $G = (V, E)$ be a simple connected graph. A perfect matching (or Kekulé structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$ . The a…

math.CO2018

On the some parameters related to matching of graph powers

Saeid Alikhani, Neda Soltani

Let $G = (V, E)$ be a simple connected graph. A matching of $G$ is a set of disjoint edges of $G$ . For every $n, m \in N$ , the $n$ -subdivision of $G$ is a simple graph $G^{\fra…

math.CO2017★ 1 cited

On the saturation number of graphs

Saeid Alikhani, Neda Soltani

Let $G = (V, E)$ be a simple connected graph. A matching $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. A matching $M$ is maximal i…

math.CO2017

More on the sixth coefficient of the matching polynomial in regular graphs

Neda Soltani, Saeid Alikhani

A matching set $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. In this paper we consider some parameters related to the matching…