7 citations · 13 across the 15 of their papers we have counts for
5 papers · 1 filter
(4,2)-choosability of planar graphs with forbidden structures
Zhanar Berikkyzy, Christopher Cox, Michael Dairyko +8
All planar graphs are 4-colorable and 5-choosable, while some planar graphs are not 4-choosable. Determining which properties guarantee that a planar graph can be colored using lis…
List-antimagic labeling of vertex-weighted graphs
Zhanar Berikkyzy, Axel Brandt, Sogol Jahanbekam +2
A graph is - if for any vertex weighting and any list assignment with $|L(e)|\geq |E(G)|…
On the distance spectra of graphs
Ghodratollah Aalipour, Aida Abiad, Zhanar Berikkyzy +8
The distance matrix of a graph is the matrix containing the pairwise distances between vertices. The distance eigenvalues of are the eigenvalues of its distance matrix and…
On the Edit Distance of Powers of Cycles
Zhanar Berikkyzy, Ryan R. Martin, Chelsea Peck
The edit distance between two graphs on the same labeled vertex set is defined to be the size of the symmetric difference of the edge sets. The edit distance function of a heredita…
Proof of a conjecture of Graham and Lovász concerning unimodality of coefficients of the distance characteristic polynomial of a tree
Ghodratollah Aalipour, Aida Abiad, Zhanar Berikkyzy +4
We establish a conjecture of Graham and Lovász that the (normalized) coefficients of the distance characteristic polynomial of a tree are unimodal; we also prove they are log-conca…