12 citations · 18 across the 8 of their papers we have counts for
6 papers · 1 filter
An infinite family of trees with irreducible characteristic polynomials
Saieed Akbari, Keivan Mallahi-Karai
Consider the tree obtained by attaching a leaf to the third vertex of a path with n-1 vertices. In this note, we prove that the characteristic polynomial of this tree is irreducibl…
Star Coloring of the Cartesian Product of Cycles
S Akbari, M Chavooshi, M Ghanbari +1
A proper vertex coloring of a graph is called a star coloring if every two color classes induce a forest whose each component is a star, which means there is no bicolored …
Some Mixed Graphs Determined by Their Spectrum
S. Akbari, A. Ghafari, M. Nahvi +1
A mixed graph is obtained from a graph by orienting some of its edges. The Hermitian adjacency matrix of a mixed graph with the vertex set , is the mat…
Graphs with Integer Matching Polynomial Roots
S. Akbari, P. Csikvari, A. Ghafari +2
In this paper, we study graphs whose matching polynomial have only integer zeros. A graph is matching integral if the zeros of its matching polynomial are all integers. We characte…
Hoffmann-Ostenhof's conjecture for traceable cubic graphs
F. Abdolhosseini, S. Akbari, H. Hashemi +1
It was conjectured by Hoffmann-Ostenhof that the edge set of every connected cubic graph can be decomposed into a spanning tree, a matching and a family of cycles. In this paper, w…
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…