1. Mutual-visibility problems on graphs of diameter twoSerafino Cicerone, Gabriele Di Stefano, Sandi Klavžar, Ismael G. Yero, 2024, izvirni znanstveni članek Povzetek: The mutual-visibility problem in a graph $G$ asks for the cardinality of a largest set of vertices $S\subseteq V(G)$ so that for any two vertices $x,y \in S$ there is a shortest $x,y$-path $P$ so that all internal vertices of $P$ are not in $S$. This is also said as $x,y$ are visible with respect to $S$, or $S$-visible for short. Variations of this problem are known, based on the extension of the visibility property of vertices that are in and/or outside $S$. Such variations are called total, outer and dual mutual-visibility problems. This work is focused on studying the corresponding four visibility parameters in graphs of diameter two, throughout showing bounds and/or closed formulae for these parameters. The mutual-visibility problem in the Cartesian product of two complete graphs is equivalent to (an instance of) the celebrated Zarankiewicz's problem. Here we study the dual and outer mutual-visibility problem for the Cartesian product of two complete graphs and all the mutual-visibility problems for the direct product of such graphs as well. We also study all the mutual-visibility problems for the line graphs of complete and complete bipartite graphs. As a consequence of this study, we present several relationships between the mentioned problems and some instances of the classical Turán problem. Moreover, we study the visibility problems for cographs and several non-trivial diameter-two graphs of minimum size. Ključne besede: mutual-visibility set, mutual-visibility number, diameter-two graphs, line graphs, cographs Objavljeno v DiRROS: 27.05.2024; Ogledov: 256; Prenosov: 208
Celotno besedilo (558,13 KB) Gradivo ima več datotek! Več... |
2. Variety of mutual-visibility problems in graphsSerafino Cicerone, Gabriele Di Stefano, Lara Drožđek, Jaka Hedžet, Sandi Klavžar, Ismael G. Yero, 2023, izvirni znanstveni članek Povzetek: If $X$ is a subset of vertices of a graph $G$, then vertices $u$ and $v$ are $X$-visible if there exists a shortest $u,v$-path $P$ such that $V(P)\cap X \subseteq \{u,v\}$. If each two vertices from $X$ are $X$-visible, then $X$ is a mutual-visibility set. The mutual-visibility number of $G$ is the cardinality of a largest mutual-visibility set of $G$ and has been already investigated. In this paper a variety of mutual-visibility problems is introduced based on which natural pairs of vertices are required to be $X$-visible. This yields the total, the dual, and the outer mutual-visibility numbers. We first show that these graph invariants are related to each other and to the classical mutual-visibility number, and then we prove that the three newly introduced mutual-visibility problems are computationally difficult. According to this result, we compute or bound their values for several graphs classes that include for instance grid graphs and tori. We conclude the study by presenting some inter-comparison between the values of such parameters, which is based on the computations we made for some specific families. Ključne besede: mutual-visibility, total mutual-visibility, dual mutual-visibility number, outer mutual-visibility, grid graphs, torus graphs, computational complexity Objavljeno v DiRROS: 10.04.2024; Ogledov: 378; Prenosov: 142
Celotno besedilo (456,36 KB) Gradivo ima več datotek! Več... |
3. Injective coloring of graphs revisitedBoštjan Brešar, Babak Samadi, Ismael G. Yero, 2023, izvirni znanstveni članek Povzetek: An open packing in a graph $G$ is a set $S$ of vertices in $G$ such that no two vertices in $S$ have a common neighbor in $G$. The injective chromatic number $\chi_i(G)$ of $G$ is the smallest number of colors assigned to vertices of ▫$G$▫ such that each color class is an open packing. Alternatively, the injective chromatic number of $G$ is the chromatic number of the two-step graph of $G$, which is the graph with the same vertex set as $G$ in which two vertices are adjacent if they have a common neighbor. The concept of injective coloring has been studied by many authors, while in the present paper we approach it from two novel perspectives, related to open packings and the two-step graph operation. We prove several general bounds on the injective chromatic number expressed in terms of the open packing number. In particular, we prove that $\chi_i(G) \ge \frac{1}{2}\sqrt{\frac{1}{4}+\frac{2m-n}{\rho^{o}}}$ holds for any connected graph $G$ of order $n\ge 2$, size $m$, and the open packing number ${\rho^{o}}$, and characterize the class of graphs attaining the bound. Regarding the well known bound $\chi_i(G)\ge \Delta(G)$, we describe the family of extremal graphs and prove that deciding when the equality holds (even for regular graphs) is NP-complete, solving an open problem from an earlier paper. Next, we consider the chromatic number of the two-step graph of a graph, and compare it with the clique number and the maximum degree of the graph. We present two large families of graphs in which $\chi_i(G)$ equals the cardinality of a largest clique of the two-step graph of $G$. Finally, we consider classes of graphs that admit an injective coloring in which all color classes are maximal open packings. We give characterizations of three subclasses of these graphs among graphs with diameter 2, and find a partial characterization of hypercubes with this property. Ključne besede: two-step graph of a graph, injective coloring, open packing, hypercubes Objavljeno v DiRROS: 09.04.2024; Ogledov: 317; Prenosov: 132
Celotno besedilo (460,72 KB) Gradivo ima več datotek! Več... |
4. On metric dimensions of hypercubesAleksander Kelenc, Aoden Teo Masa Toshi, Riste Škrekovski, Ismael G. Yero, 2023, izvirni znanstveni članek Povzetek: In this note we show two unexpected results concerning the metric, the edge metric and the mixed metric dimensions of hypercube graphs. First, we show that the metric and the edge metric dimensions of $Q_d$ differ by at most one for every integer $d$. In particular, if $d$ is odd, then the metric and the edge metric dimensions of $Q_d$ are equal. Second, we prove that the metric and the mixed metric dimensions of the hypercube $Q_d$ are equal for every $d \ge 3$. We conclude the paper by conjecturing that all these three types of metric dimensions of $Q_d$ are equal when d is large enough. Ključne besede: edge metric dimension, mixed metric dimension, metric dimension, hypercubes Objavljeno v DiRROS: 19.03.2024; Ogledov: 363; Prenosov: 72
Celotno besedilo (259,98 KB) |
5. Lower (total) mutual-visibility number in graphsBoštjan Brešar, Ismael G. Yero, 2024, izvirni znanstveni članek Povzetek: Given a graph $G$, a set $X$ of vertices in $G$ satisfying that between every two vertices in $X$ (respectively, in $G$) there is a shortest path whose internal vertices are not in $X$ is a mutual-visibility (respectively, total mutual-visibility) set in $G$. The cardinality of a largest (total) mutual-visibility set in $G$ is known under the name (total) mutual-visibility number, and has been studied in several recent works. In this paper, we propose two lower variants of these concepts, defined as the smallest possible cardinality among all maximal (total) mutual-visibility sets in $G$, and denote them by $\mu^{-}(G)$ and $\mu_t^{-}(G)$, respectively. While the total mutual-visibility number is never larger than the mutual-visibility number in a graph $G$, we prove that both differences $\mu^{-}(G)-\mu_t^{-}(G)$ and $\mu_t^{-}(G)-\mu^{-}(G)$ can be arbitrarily large. We characterize graphs $G$ with some small values of $\mu^{-}(G)$ and $\mu_t^{-}(G)$, and prove a useful tool called the Neighborhood Lemma, which enables us to find upper bounds on the lower mutual-visibility number in several classes of graphs. We compare the lower mutual-visibility number with the lower general position number, and find a close relationship with the Bollobás-Wessel theorem when this number is considered in Cartesian products of complete graphs. Finally, we also prove the NP-completeness of the decision problem related to $\mu_t^{-}(G)$. Ključne besede: mutual-visibility set, mutual-visibility number, total mutual-visibility set, computational complexity Objavljeno v DiRROS: 19.02.2024; Ogledov: 351; Prenosov: 151
Celotno besedilo (567,18 KB) Gradivo ima več datotek! Več... |
6. Resolvability and convexity properties in the Sierpiński product of graphsMichael A. Henning, Sandi Klavžar, Ismael G. Yero, 2024, izvirni znanstveni članek Povzetek: 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. Ključne besede: Sierpiński product of graphs, metric dimension, trees, convex subgraph Objavljeno v DiRROS: 16.02.2024; Ogledov: 382; Prenosov: 171
Celotno besedilo (432,07 KB) Gradivo ima več datotek! Več... |