1 citations · 1 across the 4 of their papers we have counts for
5 papers
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 $χ…
Graphs determined by signless Laplacian spectra
Ali Zeydi Abdian, Afshin Behmaram, Gholam Hossein Fath-Tabar
In the past decades, graphs that are determined by their spectrum have received more attention, since they have been applied to several fields, such as randomized algorithms, combi…
On the spectral determinations of the connected multicone graphs
Ali Zeydi Abdian, Lowell W. Beineke, Afshin Behmaram
In this study we investigate the spectra of the family of connected multicone graphs. A multicone graph is defined to be the join of a clique and a regular graph. Let , …
Asymptotic enumeration of perfect matchings in -barrel fullerene graphs
Afshin Behmaram, Cédric Boutillier
A connected planar cubic graph is called an -barrel fullerene and denoted by , if it has the following structure: The first circle is an -gon. Then -gon is bounded…
Upper bounds for perfect matchings in pfaffian and planar graphs
Afshin Behmaram, Shmuel Friedland
We give upper bounds on weighted perfect matchings in pfaffian graphs. These upper bounds are better than Bregman's upper bounds on the number of perfect matchings. We show that so…