3 citations · 3 across the 3 of their papers we have counts for
5 papers
Classification of borderenergetic chemical graphs and borderenergetic graphs of order 12
Péter Csikvári, Ivan Damnjanović, Marko Milošević +2
The energy of a simple graph is the sum of absolute values of the eigenvalues of its adjacency matrix. A borderenergetic graph of order is any noncomp…
Some applications of Wagner's weighted subgraph counting polynomial
Ferenc Bencs, Péter Csikvári, Guus Regts
We use Wagner's weighted subgraph counting polynomial to prove that the partition function of the anti-ferromagnetic Ising model on line graphs is real rooted and to prove that roo…
On Sidorenko's conjecture for determinants and Gaussian Markov random fields
Balazs Szegedy
We study a class of determinant inequalities that are closely related to Sidorenko's famous conjecture (Also conjectured by Erd\H os and Simonovits in a different form). Our result…
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…
The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph
Emma Cohen, Péter Csikvári, Will Perkins +1
Let be the path on vertices with a loop at each vertex. D. Galvin conjectured, and E. Cohen, W. Perkins and P. Tetali proved that for any -regular simple g…