This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial. This connection enables us to extend the study to other important polynomial i...
It is proved in this paper that every bipartite graphic sequence with the minimum degree 2 has a realization that admits a nowhere-zero 4-flow. This result implies a conjecture ...
A graph is said to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on t...
Yashar Ganjali, Mohammad Ghebleh, Hossein Hajiabol...
Abstract. Firms’ conjectures about demand are consequential in oligopoly games. Through agent-based modeling of consumers’ search for products, we can study the rationing of de...
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...