Montanuniversität Leoben

output

19972026

most citedExceptional damage-tolerance of a medium-entropy alloy CrCoNi at cryogenic temperatures

2k citations

Showing math.COShow all

13 papers · 1 filter

math.CO2024

Monoid algebras and graph products

Wilfried Imrich, Igor Klep, Daniel Smertnig

In this note, we extend results about unique $n^{th}$ roots and cancellation of finite disconnected graphs with respect to the Cartesian, the strong and the direct product…

math.CO2019★ 6 cited

Bounds for Distinguishing Invariants of Infinite Graphs

Wilfried Imrich, Rafał Kalinowski, Monika Pilśniak +1

We consider infinite graphs. The distinguishing number $D (G)$ of a graph $G$ is the minimum number of colours in a vertex colouring of $G$ that is preserved only by the trivial aut…

math.CO2019

Regular Graphs with Minimum Spectral Gap

M. Abdi, E. Ghorbani, W. Imrich

Aldous and Fill conjectured that the maximum relaxation time for the random walk on a connected regular graph with $n$ vertices is $(1 + o (1)) \frac{3 n ^{2}}{2 π ^{2}}$ . This conjecture can…

math.CO2018

Infinite arc-transitive and highly-arc-transitive digraphs

Rögnvaldur G. Möller, Primož Potočnik, Norbert Seifter

A detailed description of the structure of two-ended arc-transitive digraphs is given. It is also shown that several sets of conditions, involving such concepts as Property Z, loca…

math.CO2018

Sharply $k$ -arc-transitive-digraphs: finite and infinite examples

Rögnvaldur G. Möller, Primož Potočnik, Norbert Seifter

A general method for constructing sharply $k$ -arc-transitive digraphs, i.e. digraphs that are $k$ -arc-transitive but not $(k + 1)$ -arc-transitive, is presented. Using our method it i…

math.CO2017

Cartesian products of directed graphs with loops

Wilfried Imrich, Iztok Peterin

We show that every nontrivial finite or infinite connected directed graph with loops and at least one vertex without a loop is uniquely representable as a Cartesian or weak Cartesi…