arXiv subjects

Simon Špacapan

Publications and source records attributed to Simon Špacapan.

6 recordsLinked to original sources

arXiv2025

New results on the Wiener index of trees with a given diameter

We study the Wiener index of a class of trees with fixed diameter and order. A double broom is a tree such that there exist two vertices $u$ and $v$, such that each leaf of $T$ is adjacent to $u$ or $v$. We prove that for a tree $T$ of diameter $d$ and (sufficiently large) order $n$ such that $n\leq d-2+4 \left\lfloor \sqrt{ \frac{d-1}{2}} \right\rfloor$, $T$ has maximum Wiener index (in the class of trees of diameter $d$ and order $n$) if and only if $T$ is a balanced double broom. Our results are sharp up to a small constant.

math.CO↗

arXiv2024

Spanning weakly even trees of graphs

Let $G$ be a graph (with multiple edges allowed) and let $T$ be a tree in $G$. We say that $T$ is $\textit{even}$ if every leaf of $T$ belongs to the same part of the bipartition of $T$, and that $T$ is $\textit{weakly even}$ if every leaf of $T$ that has maximum degree in $G$ belongs to the same part of the bipartition of $T$. We confirm two recent conjectures of Jackson and Yoshimoto by showing that every connected graph that is not a regular bipartite graph has a spanning weakly even tree.

math.CO↗

arXiv2024

Hamiltonicity of Cartesian products of graphs

A path factor in a graph $G$ is a factor of $G$ in which every component is a path on at least two vertices. Let $T\Box P_n$ be the Cartesian product of a tree $T$ and a path on $n$ vertices. Kao and Weng proved that $T\Box P_n$ is hamiltonian if $T$ has a path factor, $n$ is an even integer and $n\geq 4Δ(T)-2$. They conjectured that for every $Δ\geq 3$ there exists a graph $G$ of maximum degree $Δ$ which has a path factor, such that for every even $n< 4Δ-2$ the product $G\Box P_n$ is not hamiltonian. In this article we prove this conjecture.

math.CO↗

arXiv2022

A note on Vizing's conjecture

Let $γ(G)$ denote the domination number of graph $G$. Let $G$ and $H$ be graphs and $G\Box H$ their Cartesian product. For $h\in V(H)$ define $G_h=\{(g,h)\,|\,g\in V(G)\}$ and call this set a $G$-layer of $G\Box H$. We prove the following special case of Vizing's conjecture. Let $D$ be a dominating set of $G\Box H$. If there exist minimum dominating sets $D_1$ and $D_2$ of $G$ such that for every $h\in V(H)$, the projection of $D\cap G_h$ to $G$ is contained in $D_1$ or $D_2$, then $|D|\geq γ(G)γ(H)$.

math.CO↗

arXiv2021

Polyhedra without cubic vertices are prism-hamiltonian

The prism over a graph $G$ is the Cartesian product of $G$ with the complete graph on two vertices. A graph $G$ is prism-hamiltonian if the prism over $G$ is hamiltonian. We prove that every polyhedral graph (i.e. 3-connected planar graph) of minimum degree at least four is prism-hamiltonian.

math.CO↗

arXiv2019

The diameter of strong orientations of strong products of graphs

Let $G$ and $H$ be graphs, and $G\boxtimes H$ the strong product of $G$ and $H$. We prove that for any connected graphs $G$ and $H$ there is a strongly connected orientation $D$ of $G\boxtimes H$ such that ${\rm diam}(D)\leq 2r+15$, where $r$ is the radius of $G\boxtimes H$.This improves the general bound ${\rm diam}(D)\leq 2r^2+2r$ for arbitrary graphs, proved by Chv${\rm \acute{a}}$tal and Thomassen.

math.CO↗