10 citations · 13 across the 13 of their papers we have counts for
18 papers
Zero-sum flows for Steiner systems
Saieed Akbari, Hamid Reza Maimani, Leila Parsaei Majd +1
Given a - design, , a zero-sum -flow of is a map such that fo…
On sign-symmetric signed graphs
Ebrahim Ghorbani, Willem H. Haemers, Hamid Reza Maimani +1
A signed graph is said to be sign-symmetric if it is switching isomorphic to its negation. Bipartite signed graphs are trivially sign-symmetric. We give new constructions of non-bi…
A Note on Induced Path Decomposition of Graphs
S. Akbari, H. R. Maimani, A. Seify
Let be a graph of order . The path decomposition of is a set of disjoint paths, say , which cover all vertices of . If all paths are induced paths in …
Some Algebraic Properties of Sierpiński-Type Graphs
Mohammad Farrokhi Derakhshandeh Ghouchan, E. Ghorbani, H. R. Maimani +1
This paper deals with some of the algebraic properties of Sierpiński graphs and a family of regular generalized Sierpiński graphs. For the family of regular generalized Sierpiński…
Steiner (revised) Szeged index of graphs
Modjtaba Ghorbani, Xueliang Li, Hamid Reza Maimani +3
The Steiner distance in a graph, introduced by Chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph of order…
On The Double Roman bondage numbers of Graphs
N. Jafari Rad, H. R. Maimani, M. Momeni +1
For a graph , a double roman dominating function (DRDF) is a function having the property that if for some vertex , then…