152 citations
- Polytechnique MontréalCA27 papers
- HEC MontréalCA13 papers
- McGill UniversityCA9 papers
- Université de MontréalCA6 papers
- Mila - Quebec Artificial Intelligence InstituteCA5 papers
- Université de SherbrookeCA4 papers
- Centre National de la Recherche ScientifiqueFR3 papers
- Université Fédérale de Toulouse Midi-PyrénéesFR3 papers
- University of EdinburghGB3 papers
- Kyoto UniversityJP2 papers
- Laboratoire des Sciences du Numérique de NantesFR2 papers
- Laboratoire des Sciences pour la Conception, l'Optimisation et la ProductionFR2 papers
Showing math.COShow all
3 papers · 1 filter
math.CO2026★ 5 cited
On (distance) Laplacian characteristic polynomials of power graphs
Bilal Ahmad Rather, Mustapha Aouchiche, Victor A. Bovdi
The characteristic polynomials of the Laplacian and the distance Laplacian matrices of power graphs of groups of order , where and are { primes,} are obtained.…
math.CO2020
Counting independent sets in Riordan graphs
Gi-Sang Cheon, Ji-Hwan Jung, Bumtle Kang +4
The notion of a Riordan graph was introduced recently, and it is a far-reaching generalization of the well-known Pascal graphs and Toeplitz graphs. However, apart from a certain su…
math.CO2013★ 23 cited
On the extension complexity of combinatorial polytopes
David Avis, Hans Raj Tiwary
In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponen…