output
19932026
most citedTheory of Quantum Annealing of an Ising Spin Glass

733 citations

Showing math.COShow all

18 papers · 1 filter

math.CO2022★ 3 cited

Quotients of skew morphisms of cyclic groups

Martin Bachratý

A skew morphism of a finite group is a permutation of that preserves the identity element of and has the property that for every there exists a positive in…

math.CO2021

A note on the metric and edge metric dimensions of 2-connected graphs

Martin Knor, Riste Skrekovski, Ismael G. Yero

For a given graph , the metric and edge metric dimensions of , and , are the cardinalities of the smallest possible subsets of vertices in suc…

math.CO2020

Voltage lifts of graphs from a category theory viewpoint

Gejza Jenča

We prove that the notion of a derived voltage graph comes from an adjunction between the category of voltage graphs and a category of group labeled graphs.

math.CO2020★ 1 cited

Colouring problems for symmetric configurations with block size 3

Grahame Erskine, Terry Griggs, Jozef Širáň

The study of symmetric configurations with block size 3 has a long and rich history. In this paper we consider two colouring problems which arise naturally in the study of th…

math.CO2019

A note on the spectra and eigenspaces of the universal adjacency matrices of arbitrary lifts of graphs

C. Dalfó, M. A. Fiol, S. Pavlíková +1

The universal adjacency matrix of a graph , with adjacency matrix , is a linear combination of , the diagonal matrix of vertex degrees, the identity matrix , an…

math.CO2019★ 5 cited

On the upper embedding of symmetric configurations with block size 3

Grahame Erskine, Terry Griggs, Jozef Širáň

We consider the problem of embedding a symmetric configuration with block size 3 in an orientable surface in such a way that the blocks of the configuration form triangular faces a…

math.CO2018★ 1 cited

Clique-partitioned graphs

Grahame Erskine, Terry Griggs, Jozef Širáň

A graph of order where and is said to be weakly -clique-partitioned if its vertex set can be decomposed in a unique way into vertex-disjoint…

math.CO2018

Regular self-dual and self-Petrie-dual maps of arbitrary valency

Jay Fraser, Olivia Jeans, Jozef Širáň

The main result of D. Archdeacon, M. Conder and J. Širáň [Trans. Amer. Math. Soc. 366 (2014) 8, 4491-4512] implies existence of a regular, self-dual and self-Petrie dual map of any…

math.CO2017★ 1 cited

The Graovac-Pisanski index of connected bipartite graphs with applications to hydrocarbon molecules

Matevž Črepnjak, Martin Knor, Niko Tratnik +1

The Graovac-Pisanski index, also called the modified Wiener index, was introduced in 1991 and represents an extension of the original Wiener index, because it considers beside the…

math.CO2017

The spectra of lifted digraphs

C. Dalfó, M. A. Fiol, J. Širáň

We present a method to derive the complete spectrum of the lift of a base digraph , with voltage assignments on a (finite) group . The method is based on assigning to $…

math.CO2017★ 3 cited

On a Construction of Integrally Invertible Graphs and their Spectral Properties

Sona Pavlikova, Daniel Sevcovic

Godsil (1985) defined a graph to be invertible if it has a non-singular adjacency matrix whose inverse is diagonally similar to a nonnegative integral matrix; the graph defined by…

math.CO2017

Two monads on the category of graphs

Gejza Jenča

We introduce two monads on the category of graphs and prove that their Eilenberg-Moore categories are isomorphic to the category of perfect matchings and the category of partial St…

math.CO2016★ 1 cited

An algebraic approach to lifts of digraphs

C. Dalfó, M. A. Fiol, M. Miller +2

We study the relationship between two key concepts in the theory of (di)graphs: the quotient digraph, and the lift of a base (voltage) digraph. These techniques contract or e…

math.CO2016★ 2 cited

Large Cayley digraphs and bipartite Cayley digraphs of odd diameters

Marcel Abas, Tomas Vetrik

Let be the largest number of vertices in a Cayley digraph of degree and diameter , and let be the largest order of a bipartite Cayley digraph for given…

math.CO2016★ 13 cited

On the difference between the Szeged and Wiener index

Marthe Bonamy, Martin Knor, Borut Lužar +2

We prove a conjecture of Nadjafi-Arani, Khodashenas and Ashrafi on the difference between the Szeged and Wiener index of a graph. Namely, if is a 2-connected non-complete graph…

math.CO2015★ 5 cited

Cayley graphs of diameter two with order greater than 0.684 of the Moore bound for any degree

Marcel Abas

It is known that the number of vertices of a graph of diameter two cannot exceed . In this contribution we give a new lower bound for orders of Cayley graphs of diameter two…

math.CO2015★ 1 cited

Large Networks of Diameter Two Based on Cayley Graphs

Marcel Abas

In this contribution we present a construction of large networks of diameter two and of order for every degree , based on Cayley graphs with surprisingly…

math.CO2011★ 3 cited

Linear extensions and order-preserving poset partitions

Gejza Jenča, Peter Sarkoci

We examine the lattice of all order congruences of a finite poset from the viewpoint of combinatorial algebraic topology. We will prove that the order complex of the lattice of all…