3 papers
cs.DM2019
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…
math.CO2015
On 1-sum flows in undirected graphs
S. Akbari, S. Friedland, K. Markström +1
Let G=(V,E) be a simple undirected graph. For a given set L of the real line, a function omega from E to L is called an L-flow. Given a vector gamma whose coordinates are indexed b…
math.CO2011
A note on zero-sum 5-flows in regular graphs
S. Akbari, N. Ghareghani, G. B. Khosrovshahi +1
Let be a graph. A zero-sum flow in is an assignment of nonzero real number to the edges such that the sum of the values of all edges incident with each vertex is zero. Let…