Digital repository of Slovenian research organisations

Search the repository
A+ | A- | Help | SLO | ENG

Query: search in
search in
search in
search in

Options:
  Reset


Query: "author" (Michael A. Henning) .

1 - 2 / 2
First pagePrevious page1Next pageLast page
1.
Resolvability and convexity properties in the Sierpiński product of graphs
Michael A. Henning, Sandi Klavžar, Ismael G. Yero, 2024, original scientific article

Abstract: Let $G$ and $H$ be graphs and let $f \colon V(G)\rightarrow V(H)$ be a function. The Sierpiński product of $G$ and $H$ with respect to $f$, denoted by $G \otimes _f H$, is defined as the graph on the vertex set $V(G)\times V(H)$, consisting of $|V(G)|$ copies of $H$; for every edge $gg'$ of $G$ there is an edge between copies $gH$ and $g'H$ of $H$ associated with the vertices $g$ and $g'$ of $G$, respectively, of the form $(g,f(g'))(g',f(g))$. The Sierpiński metric dimension and the upper Sierpiński metric dimension of two graphs are determined. Closed formulas are determined for Sierpiński products of trees, and for Sierpiński products of two cycles where the second factor is a triangle. We also prove that the layers with respect to the second factor in a Sierpiński product graph are convex.
Keywords: Sierpiński product of graphs, metric dimension, trees, convex subgraph
Published in DiRROS: 16.02.2024; Views: 141; Downloads: 59
.pdf Full text (432,07 KB)
This document has many files! More...

2.
Partial domination in supercubic graphs
Csilla Bujtás, Michael A. Henning, Sandi Klavžar, 2024, original scientific article

Abstract: For some $\alpha$ with $0 < \alpha \le 1$, a subset $X$ of vertices in a graph $G$ of order $n$ is an $\alpha$-partial dominating set of $G$ if the set $X$ dominates at least $\alpha \times n$ vertices in $G$. The $\alpha$-partial domination number ${\rm pd}_{\alpha}(G)$ of $G$ is the minimum cardinality of an $\alpha$-partial dominating set of $G$. In this paper partial domination of graphs with minimum degree at least $3$ is studied. It is proved that if $G$ is a graph of order $n$ and with $\delta(G)\ge 3$, then ${\rm pd}_{\frac{7}{8}}(G) \le \frac{1}{3}n$. If in addition $n\ge 60$, then ${\rm pd}_{\frac{9}{10}}(G) \le \frac{1}{3}n$, and if $G$ is a connected cubic graph of order $n\ge 28$, then ${\rm pd}_{\frac{13}{14}}(G) \le \frac{1}{3}n$. Along the way it is shown that there are exactly four connected cubic graphs of order $14$ with domination number $5$.
Keywords: domination, partial domination, cubic graphs, supercubic graphs
Published in DiRROS: 15.02.2024; Views: 144; Downloads: 69
.pdf Full text (304,87 KB)
This document has many files! More...
Search done in 0.03 sec.
Back to top