30 citations · 64 across the 36 of their papers we have counts for
6 papers · 1 filter
On Prime Matrix Product Factorizations
Saieed Akbari, Mohamad Parsa Elahimanes, Bobby Miraftab
A graph factors into graphs and via a matrix product if , where , , and are the adjacency matrices of , , and , respectively. The graph i…
On Matrix Product Factorization of Cayley graphs
Allen W. Herman, Bobby Miraftab
We study when the adjacency matrix of a Cayley graph factors as the product of two adjacency matrices of Cayley graphs. Let be a finite group and let $U\subseteq G\setminus \{e…
Triangle-Covered Graphs: Algorithms, Complexity, and Structure
Amirali Madani, Anil Maheshwari, Babak Miraftab +1
The widely studied edge modification problems ask how to minimally alter a graph to satisfy certain structural properties. In this paper, we introduce and study a new edge modifica…
Spectra of Corona Products of Digraphs
Michael Cavers, Farzad Maghsoudi, Babak Miraftab
Two types of corona products for simple directed graphs are introduced, extending the classical notions from the undirected setting: the vertex-corona and the arc-corona. Their str…
Separation Number and Treewidth, Revisited
Hussein Houdrouge, Babak Miraftab, Pat Morin
We give a constructive proof of the fact that the treewidth of a graph is bounded by a linear function of the separation number of .
Algorithms and Hardness Results for the -Cover Problem
Amirali Madani, Anil Maheshwari, Babak Miraftab +1
A connected graph has a -cover if each of its edges is contained in at least cliques of order . Motivated by recent advances in extremal combinatorics and the l…