SearcharxivSearch

arXiv subjects

Sandi Klavžar

Publications and source records attributed to Sandi Klavžar.

At least 19 recordsLinked to original sources

Domination game and total domination game played on Sierpiński graphs

The game domination numbers $γ_{\rm g}$ and $γ_{\rm g}^\prime$, and the game total domination numbers $γ_{\rm{tg}}$ and $γ_{\rm{tg}}^\prime$ are investigated on Sierpiński graphs $S_p^n$. For the domination game, the trivial bounds arising from the known domination number and the Grundy domination number of $S_p^n$ are significantly improved by proving that $(2p-3)p^{n-2}\leq γ_{\rm g}(S_p^n), γ_{\rm g}^\prime(S_p^n) \leq (2p-2)p^{n-2}$. For the total domination game the bounds $γ_{\rm{tg}}(S_p^n), γ_{\rm{tg}}^\prime(S_p^n) \geq (2p-2)p^{n-2}$ are established.

math.CO

The General Position Problem: A Survey

Inspired by a chessboard puzzle of Dudeney, the general position problem in graph theory asks for a largest set $S$ of vertices in a graph such that no three elements of $S$ lie on a common shortest path. The number of vertices in such a largest set is the \emph{general position number} of the graph. This paper provides a survey of this rapidly growing problem, which now has an extensive literature. We cover exact results for various graph classes and the behaviour of the general position number under graph products and operations. We also discuss interesting variations of the general position problem, including those corresponding to different graph convexities, as well as dynamic, fractional, colouring and game versions of the problem.

math.CO

Edge transmission irregular graphs

The transmission of a vertex $v$ in a connected graph $G$ is the sum of distances from $v$ to all vertices in $G$. A transmission irregular (TI) graph is a connected graph in which any two distinct vertices have different transmissions. We extend the concept of transmission to edges by defining the transmission of an edge as the sum of the transmissions of its two endpoints. A connected graph can now be called edge transmission irregular (ETI) if any two distinct edges have different transmissions. We show that almost all graphs are not ETI and then investigate several related order realizability problems involving chemical ETI graphs. In particular, we prove that for every $n \ge 15$, there exists a subcubic tree of order $n$ that is both TI and ETI.

math.CO

Multiset resolvability parameters in graphs: A survey with new results and open problems

The metric dimension, which has lots of variants and numerous applications in other fields, is one of the most important and most extensively studied topics in metric graph theory. Results in which resolvability is achieved by considering multisets of distances from a fixed vertex, instead of vectors as in the original version, are surveyed. The concepts discussed are multiset dimension, outer multiset dimension, local multiset dimension, edge multiset dimension, and $k$-multiset antidimension. Along the way, sharp lower bounds on the outer multiset dimension of diameter two graphs and join graphs with edgeless graphs are proved, which solves two open problems from the literature. New results on graphs with local multiset dimension equal to two are also proved. In particular, such graphs are characterized among block graphs. Finally, a list of open problems from the literature is compiled, and several new problems are added to the list for future research.

math.CO

Computing fault-tolerant metric dimension of graphs using their primary subgraphs

The metric dimension of a graph is the cardinality of a minimum resolving set, which is the set of vertices such that the distance representations of every vertex with respect to that set are unique. A fault-tolerant metric basis is a resolving set with a minimum cardinality that continues to resolve the graph even after the removal of any one of its vertices. The fault-tolerant metric dimension is the cardinality of such a fault-tolerant metric basis. In this article, we investigate the fault-tolerant metric dimension of graphs formed through the point-attaching process of primary subgraphs. This process involves connecting smaller subgraphs to specific vertices of a base graph, resulting in a more complex structure. By analyzing the distance properties and connectivity patterns, we establish explicit formulae for the fault-tolerant resolving sets of these composite graphs. Furthermore, we extend our results to specific graph products, such as rooted products. For these products, we determine the fault-tolerant metric dimension in terms of the fault-tolerant metric dimension of the primary subgraphs. Our findings demonstrate how the fault-tolerant dimension is influenced by the structural characteristics of the primary subgraphs and the attaching vertices. These results have potential applications in network design, error correction, and distributed systems, where robustness against vertex failures is crucial.

math.CO

Maker-Breaker Sabotage Game

The Maker-Breaker sabotage game is played on a graph $G$ by Runner and Blocker. They play in turns, Runner first moves along a not yet traversed edge from her current position, afterwards Blocker removes one edge. The goal of Runner is to visit as many vertices of $G$ as possible, Blocker's goal is opposite. Assuming that both players use optimal strategies, the number of vertices visited by Runner determines an invariant called the sabotage number ${\rm sab}(G)$ of $G$. A formula for the sabotage number of an arbitrary tree is proved which can be evaluated in polynomial time. For a unicyclic graph $G$ it is proved that ${\rm sab}(G)\in \{{\rm sab}^-(G), {\rm sab}^-(G)+1\}$, where ${\rm sab}^-(G)$ is the lower sabotage number of $G$. The sabotage number of a bridgeless subcubic graph is sharply bounded from the above by the maximum girth. The sabotage number is also bounded for complete bipartite graphs and generalized Sierpiński graphs, and determined exactly in some special cases.

math.CO

Bounds on the game isolation number and exact values for paths and cycles

The isolation game is played on a graph $G$ by two players who take turns playing a vertex such that if $X$ is the set of already played vertices, then a vertex can be selected only if it dominates a vertex from a nontrivial component of $G \setminus N_G[X]$, where $N_G[X]$ is the set of vertices in $X$ or adjacent to a vertex in $X$. Dominator wishes to finish the game with the minimum number of played vertices, while Staller has the opposite goal. The game isolation number $ι_{\rm g}(G)$ is the number of moves in the Dominator-start game where both players play optimally. If Staller starts the game the invariant is denoted by $ι_{\rm g}'(G)$. In this paper, $ι_{\rm g}(C_n)$, $ι_{\rm g}(P_n)$, $ι_{\rm g}'(C_n)$, and $ι_{\rm g}'(P_n)$ are determined for all $n$. It is proved that there are only two graphs that attain equality in the upper bound $ι_{\rm g}(G) \le \frac{1}{2}|V(G)|$, and that there are precisely eleven graphs which attain equality in the upper bound $ι_{\rm g}'(G) \le \frac{1}{2}|V(G)|$. For trees $T$ of order at least three it is proved that $ι_{\rm g}(T) \le \frac{5}{11}|V(T)|$. A new infinite family of graphs $G$ is also constructed for which $ι_{\rm g}(G) = ι_{\rm g}'(G) = \frac{3}{7}|V(G)|$ holds.

math.CO

Improved Lower Bounds on the General Reduced Second Zagreb Index of Trees and Unicyclic Graphs

For a simple graph $Γ$ and a real number $λ$, the general reduced second Zagreb index is defined by the formula $$GRM_λ(Γ)=\sum_{ab\in E(Γ)}[(°_Γ(a)+λ)(°_Γ(b)+λ)]\,.$$ A sharp lower bound for $GRM_λ$ over all trees of given order and maximum degree under the condition that $λ\ge -\frac{1}{2}$ is established. A parallel result is proved for unicyclic graphs under the condition $λ\ge -\frac{1}{2}$. The corresponding minimal trees and unicyclic graphs are identified. These findings improve upon the lower bounds previously established by Buyantogtokh, Horoldagva, and Das concerning $GRM_λ$ of trees and unicyclic graphs of given order.

math.CO

Wiener and Average Distance of Irregular Square-Cell Configuration

A subgraph of the square lattice with all of its inner faces being 4-cycles is called a square-cell configuration. Prior work has provided explicit expressions for the total and average distances between vertex pairs in symmetric square-cell configurations, including well-structured families such as hexagonal square-cell configurations $H(n)$, trapezium square-cell configurations $T(n,k)$, and bitrapezium square-cell configurations $BT(n,k_1,k_2)$. In this article, we further extend the square-cell configuration from regular boundaries to irregular boundaries, which do not exhibit complete regularity or symmetry in their structure. We find the generalized expressions for the Wiener index and average distance of such irregular configurations, incorporating combinatorial and structural variations. Our results demonstrate how irregularity affects the growth and distribution of pairwise distances and provide a unifying framework that includes both symmetric and asymmetric square-cell graphs as exceptional cases. This generalization provides novel insights into the structural behaviour of square-cell frameworks characterized by complex or perturbed geometries.

math.CO

M-Polynomial of Product Graphs

The M-polynomial provides a unifying framework for a wide class of degree-based topological indices. Despite its structural importance, general methods for computing the M-polynomial under graph constructions remain limited. In this paper, explicit formulas, and compact ones whenever possible, for the M-polynomial under different graph products whose vertex sets are the Cartesian product of the factors are developed. The products studied are the direct, the Cartesian, the strong, the lexicographic, the symmetric-difference, the disjunction, and the Sierpiński product. The obtained formulas yield a unified structural description of how vertex-degree interactions propagate under graph constructions and extend existing results for degree-based indices at the polynomial level.

math.CO

Independent mutual-visibility sets and distance edge-critical graphs

In this paper, connections between independent sets and the variety of mutual-visibility sets are studied. It is proved that every outer mutual-visibility set of a graph is independent if and only if the graph is distance edge-critical. Several constructions yielding distance edge-critical graphs are given. Graphs in which every independent set is a total mutual-visibility or a dual mutual-visibility set are characterized, as well as graphs in which every total mutual-visibility set is independent. Along the way the total mutual-visibility number of some graphs derived from fullerenes is determined. Graphs in which every independent set is a mutual-visibility set are discussed and characterized over diameter four graphs. It is proved that determining the maximum cardinality of an independent mutual-visibility set and deciding whether it equals the independence number of a graph are NP-hard problems, and the same is true for independent total, outer and dual mutual-visibility sets.

math.CO

On the variety of general position problems under vertex and edge removal

Let ${\rm gp}_{\rm t}(G)$, ${\rm gp}_{\rm o}(G)$, and ${\rm gp}_{\rm d}(G)$ be the total, the outer, and the dual general position number of a graph $G$, respectively. This paper investigates how removing a vertex or removing an edge affects these graph invariants. It is proved that if $x$ is not a cut vertex, then ${\rm gp}_{\rm t}(G) -1 \le {\rm gp}_{\rm t}(G-x) \le {\rm gp}_{\rm t}(G) + {\rm deg}_G(x)$. On the other hand, ${\rm gp}_{\rm o}(G-x)$ and ${\rm gp}_{\rm d}(G-x)$ can be respectively arbitrarily larger/smaller than ${\rm gp}_{\rm o}(G)$ and ${\rm gp}_{\rm d}(G)$. On the positive side, it is proved that if $x$ lies in some ${\rm gp}_{\rm o}$-set, then ${\rm gp}_{\rm o}(G)-1 \le {\rm gp}_{\rm o}(G-x)$, and that if $x$ is not a cut vertex and lies in some ${\rm gp}_{\rm d}$-set of $G$, then $ {\rm gp}_{\rm d}(G)-1 \le {\rm gp}_{\rm d}(G-x)$. For the edge removal, it is proved that (i) ${\rm gp}_{\rm t}(G) -|S(G)_{e}| \le {\rm gp}_{\rm t}(G-e) \le {\rm gp}_{\rm t}(G) +2$, where $S(G)_{e}$ is the set of simplicial vertices adjacent to both endvertices of $e$, (ii) ${\rm gp}_{\rm o}(G)/2\le {\rm gp}_{\rm o}(G-e)\leq\ 2{\rm gp}_{\rm o}(G)$, and (iii) that ${\rm gp}_{\rm d}(G) - {\rm gp}_{\rm d}(G-e)$ can be arbitrarily large. All bounds are demonstrated to be sharp.

math.CO

Fault-tolerant mutual-visibility: complexity and solutions for grid-like networks

Networks are often modeled using graphs, and within this setting we introduce the notion of $k$-fault-tolerant mutual visibility. Informally, a set of vertices $X \subseteq V(G)$ in a graph $G$ is a $k$-fault-tolerant mutual-visibility set ($k$-ftmv set) if any two vertices in $X$ are connected by a bundle of $k+1$ shortest paths such that: ($i$) each shortest path contains no other vertex of $X$, and ($ii$) these paths are internally disjoint. The cardinality of a largest $k$-ftmv set is denoted by $\mathrm{f}μ^{k}(G)$. The classical notion of mutual visibility corresponds to the case $k = 0$. This generalized concept is motivated by applications in communication networks, where agents located at vertices must communicate both efficiently (i.e., via shortest paths) and confidentially (i.e., without messages passing through the location of any other agent). The original notion of mutual visibility may fail in unreliable networks, where vertices or links can become unavailable. Several properties of $k$-ftmv sets are established, including a natural relationship between $\mathrm{f}μ^{k}(G)$ and $ω(G)$, as well as a characterization of graphs for which $\mathrm{f}μ^{k}(G)$ is large. It is shown that computing $\mathrm{f}μ^{k}(G)$ is NP-hard for any positive integer $k$, whether $k$ is fixed or not. Exact formulae for $\mathrm{f}μ^{k}(G)$ are derived for several specific graph topologies, including grid-like networks such as cylinders and tori, and for diameter-two networks defined by Hamming graphs and by the direct product of complete graphs.

math.CO

Maker-Breaker resolving game played on lexicographic products of graphs

In the Maker-Breaker resolving game, two players named Resolver and Spoiler alternately select unplayed vertices of a given graph $G$. The aim of Resolver is to select all the vertices of some resolving set of $G$, while Spoiler aims to select at least one vertex from every resolving set of $G$. In this paper, this game is investigated on the lexicographic product of graphs. It is proved that if Spoiler has a winning strategy on a graph $H$ no matter who starts the game, or if the first player has a winning strategy on $H$, then Spoiler always has a winning strategy on $G\circ H$. Special attention is paid to lexicographic products in which the second factor is either complete, or a path, or a cycle. For instance, in $G\circ P_{2\ell}$ and in $G\circ C_{2\ell}$, Resolver always wins, while in $G\circ P_{2\ell+1}$ and in $G\circ C_{2\ell+1}$ the same conclusion holds provided $G$ is free from false twins. On the other hand, Spoiler always wins on $G\circ P_5$. In most of the cases, the corresponding Maker-Breaker resolving number is also determined.

math.CO

Monophonic position sets of Cartesian and lexicographic products of graphs

The general position problem in graph theory asks for the number of vertices in a largest set $S$ of vertices of a graph $G$ such that no shortest path of $G$ contains more than two vertices of $S$. The analogous monophonic position problem is obtained from the general position problem by replacing ``shortest path'' by ``induced path.'' In this paper the monophonic position number is studied on Cartesian and lexicographic products of graphs. It is proved that in Cartesian products, a monophonic position set can only be in one of three canonical forms, named layered, varied, and cliquey. The monophonic position number of an arbitrary Cartesian product is bounded from below and above. The two bounds coincide if neither of the factors has simplicial vertices. A formula for the monophonic position number of a lexicographic product is given which only contains the clique number and the structure of monophonic sets of the second factor.

math.CO

The vertex visibility number of graphs

If $x\in V(G)$, then $S\subseteq V(G)\setminus\{x\}$ is an $x$-visibility set if for any $y\in S$ there exists a shortest $x,y$-path avoiding $S$. The $x$-visibility number $v_x(G)$ is the maximum cardinality of an $x$-visibility set, and the maximum value of $v_x(G)$ among all vertices $x$ of $G$ is the vertex visibility number ${\rm vv}(G)$ of $G$. It is proved that ${\rm vv}(G)$ is equal to the largest possible number of leaves of a shortest-path tree of $G$. Deciding whether $v_x(G) \ge k$ holds for given $G$, a vertex $x\in V(G)$, and a positive integer $k$ is NP-complete even for graphs of diameter $2$. Several general sharp lower and upper bounds on the vertex visibility number are proved. The vertex visibility number of Cartesian products is also bounded from below and above, and the exact value of the vertex visibility number is determined for square grids, square prisms, and square toruses.

cs.DM

Moving through Cartesian products, coronas and joins in general position

The general position problem asks for large sets of vertices such that no three vertices of the set lie on a common shortest path. Recently a dynamic version of this problem was defined, called the \emph{mobile general position problem}, in which a collection of robots must visit all the vertices of the graph whilst remaining in general position. In this paper we investigate this problem in the context of Cartesian products, corona products and joins, giving upper and lower bounds for general graphs and exact values for families including grids, cylinders, Hamming graphs and prisms of trees.

math.CO

On $d$-distance $p$-packing domination number in strong products

The $d$-distance $p$-packing domination number $γ_d^p(G)$ of a graph $G$ is the cardinality of a smallest set of vertices of $G$ which is both a $d$-distance dominating set and a $p$-packing. If no such set exists, then we set $γ_d^p(G) = \infty$. For an arbitrary strong product $G\boxtimes H$ it is proved that $γ_d^p(G\boxtimes H) \le γ_d^p(G) γ_d^p(H)$. By proving that $γ_d^p(P_m \boxtimes P_n) = \left \lceil \frac{m}{2d+1} \right \rceil \left \lceil \frac{n}{2d+1} \right \rceil$, and that if $γ_d^p(C_n) < \infty$, then $γ_d^p(P_m \boxtimes C_n) = \left \lceil \frac{m}{2d+1} \right \rceil \left \lceil \frac{n}{2d+1} \right \rceil$, the sharpness of the upper bound is demonstrated. On the other hand, infinite families of strong toruses are presented for which the strict inequality holds. For instance, we present strong toruses with difference $2$ and demonstrate that the difference can be arbitrarily large if only one factor is a cycle. It is also conjectured that if $γ_d^p(G) = \infty$, then $γ_d^p(G\boxtimes H) = \infty$ for every graph $H$. Several results are proved which support the conjecture, in particular, if $γ_d^p(C_m)= \infty$, then $γ_d^p(C_m \boxtimes C_n)=\infty$.

math.CO