3 citations · 5 across the 11 of their papers we have counts for
11 papers
Enumeration of orientably-regular maps with automorphism group $\PGam(2,2^p)$ for prime
Yan-Quan Feng, Soňa Pavlíková, Jozef Širáň +2
With help of group characters we enumerate orientably-regular maps of a given type with automorphism group isomorphic to $\PGam(2,2^p)$ for prime .
Token graphs of Cayley graphs as lifts
C. Dalfó, M. A. Fiol, S. Pavlíková +1
This paper describes a general method for representing -token graphs of Cayley graphs as lifts of voltage graphs. This allows us to construct line graphs of circulant graphs and…
Qualitative, statistical and extreme properties of spectral indices of signable pseudo-invertible graphs
Sona Pavlikova, Daniel Sevcovic
In this paper, we investigate the Moore-Penrose inversion of a simple connected graph. We analyze qualitative, statistical, and extreme properties of spectral indices of signable p…
Orientably-regular embeddings of complete multigraphs
Stefan Gyurki, Sona Pavlikova, Jozef Siran
An embedding of a graph on an orientable surface is orientably-regular (or rotary, in an equivalent terminology) if the group of orientation-preserving automorphisms of the embeddi…
Extreme and statistical properties of eigenvalue indices of simple connected graphs
Sona Pavlikova, Daniel Sevcovic, Jozef Siran
We analyze graphs attaining the extreme values of various spectral indices in the class of all simple connected graphs, as well as in the class of graphs which are not complete mul…
On the Moore-Penrose pseudo-inversion of block symmetric matrices and its application in the graph theory
Sona Pavlikova, Daniel Sevcovic
The purpose of this paper is to analyze the Moore-Penrose pseudo-inversion of symmetric real matrices with application in the graph theory. We introduce a novel concept of positive…
Characters of twisted fractional linear groups
Soňa Pavlíková, Jozef Širáň
We determine character tables for twisted fractional linear groups that form the `other' family in Zassenhaus' classification of finite sharply 3-transitive groups.
On Construction of Upper and Lower Bounds for the HOMO-LUMO Spectral Gap
Sona Pavlikova, Daniel Sevcovic
In this paper we study spectral properties of graphs which are constructed from two given invertible graphs by bridging them over a bipartite graph. We analyze the so-called HOMO-L…
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…
Invertibility of graphs with a unique perfect matching
Sona Pavlikova, Daniel Sevcovic
In this paper we investigate invertibility of graphs with a unique perfect matching, i.e. graphs having a unique 1-factor. We recall the new notion of the so-called negatively inve…
Maximization of the Spectral Gap for Chemical Graphs by means of a Solution to a Mixed Integer Semidefinite Program
Sona Pavlikova, Daniel Sevcovic
In this paper we analyze the spectral gap of a weighted graph which is the difference between the smallest positive and largest negative eigenvalue of its adjacency matrix. Such a…