13 citations · 53 across the 39 of their papers we have counts for
9 papers · 1 filter
Independent Domination in Subcubic Graphs
A. Akbari, S. Akbari, A. Doosthosseini +3
A set of vertices in a graph is a dominating set if every vertex not in is adjacent to a vertex in . If, in addition, is an independent set, then is an indep…
Some Results on Dominating Induced Matchings
Saieed Akbari, Hossein Baktash, Amin Behjati +2
Let be a graph, a dominating induced matching (DIM) of is an induced matching that dominates every edge of . In this paper we show that if a graph has a DIM, then $χ…
Well-indumatched Trees and Graphs of Bounded Girth
S. Akbari, T. Ekim, A. H. Ghodrati +1
A graph G is called well-indumatched if all of its maximal induced matchings have the same size. In this paper we characterize all well-indumatched trees. We provide a linear time…
Equimatchable Claw-Free Graphs
Saieed Akbari, Hadi Alizadeh, Tınaz Ekim +2
A graph is equimatchable if all of its maximal matchings have the same size. A graph is claw-free if it does not have a claw as an induced subgraph. In this paper, we provide, to t…
Improper Twin Edge Coloring of Graphs
Paniz Abedin, Saieed Akbari, Marc Demange +1
Let be a graph whose each component has order at least 3. Let for some integer be an improper edge coloring of (where adjacent…
Even and Odd Cycles Passing a Given Edge or a Vertex
Saieed Akbari, Khashayar Etemadi, Peyman Ezzati +1
In this paper we provide some sufficient conditions for the existence of an odd or even cycle that passing a given vertex or an edge in -connected or -edge connected graphs.…