Babak Samadi

activity

20242026

most citedInduced matching vs edge open packing: trees and product graphs

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

collaborators

7 papers

math.CO2026

Frugal coloring of graphs revisited

Boštjan Brešar, Wenjie Hu, Babak Samadi

Given a graph $G$ and a positive integer $t$ , an independent set $S \subseteq V (G)$ is $t$ -frugal if every vertex has at most $t$ neighbors in $S$ . A $t$ -frugal coloring of $G$ is a…

math.CO2025

Distance mutual-visibility coloring: relations with (total) domination, exact distance graphs and graph products

Saneesh Babu, Boštjan Brešar, Aparna Lakshmanan S +1

The concept of mutual-visibility (MV) has been extended in several directions. A vertex subset $S$ of a graph $G$ is a $k$ -distance mutual-visibility ( $k$ DMV) set if for any two ve…

math.CO2025

On $k$ -coalition in graphs: bounds and exact values

Boštjan Brešar, Michael A. Henning, Babak Samadi

Given a graph $G=\big{(}V(G),E(G)\big{)}$, a set $S \subseteq V (G)$ is called a $k$ -dominating set if every vertex in $V (G) ∖ S$ has at least $k$ neighbors in $S$ . Two disjoi…

math.CO2025

Independent mutual-visibility coloring and related concepts

Boštjan Brešar, Iztok Peterin, Babak Samadi +1

Given a graph $G$ , a subset $M \subseteq V (G)$ is a mutual-visibility (MV) set if for every $u, v \in M$ , there exists a $u, v$ -geodesic whose internal vertices are not in $M$ . We inve…

math.CO2025

Total $k$ -coalition: bounds, exact values and an application to double coalition

Boštjan Brešar, Sandi Klavžar, Babak Samadi

Let $G=\big{(}V(G),E(G)\big{)}$ be a graph with minimum degree $k$ . A subset $S \subseteq V (G)$ is called a total $k$ -dominating set if every vertex in $G$ has at least $k$ neighbor…

math.CO2024★ 1 cited

Induced matching vs edge open packing: trees and product graphs

Bostjan Bresar, Tanja Dravec, Jaka Hedzet +1

Given a graph $G$ , the maximum size of an induced subgraph of $G$ each component of which is a star is called the edge open packing number, $ρ_{e}^{o} (G)$ , of $G$ . Similarly, the m…

math.CO2024

Edge open packing: complexity, algorithmic aspects, and bounds

Boštjan Brešar, Babak Samadi

Given a graph $G$ , two edges $e_{1}, e_{2} \in E (G)$ are said to have a common edge $e$ if $e$ joins an endvertex of $e_{1}$ to an endvertex of $e_{2}$ . A subset $B \subseteq E (G)$ is…

Frugal coloring of graphs revisited

Distance mutual-visibility coloring: relations with (total) domination, exact distance graphs and graph products

On k-coalition in graphs: bounds and exact values

Independent mutual-visibility coloring and related concepts

Total k-coalition: bounds, exact values and an application to double coalition

Induced matching vs edge open packing: trees and product graphs

Edge open packing: complexity, algorithmic aspects, and bounds

On $k$ -coalition in graphs: bounds and exact values

Total $k$ -coalition: bounds, exact values and an application to double coalition