1. 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: 65; Prenosov: 50
 Celotno besedilo (460,72 KB)
Gradivo ima več datotek! Več... |
2. 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: 112; Prenosov: 34
Celotno besedilo (259,98 KB) |
3. Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphsAida Abiad, Shaun M. Fallat, Mark Kempton, Rupert H. Levene, Polona Oblak, Helena Šmigoc, Michael Tait, Kevin N. Vander Meulen, 2023, izvirni znanstveni članek Ključne besede: inverse eigenvalue problem, minimum number of distinct eigenvalues, borderings, joins of graphs, paths, cycles, hypercubes
Objavljeno v DiRROS: 18.03.2024; Ogledov: 87; Prenosov: 46
Celotno besedilo (485,46 KB)
Gradivo ima več datotek! Več... |
4. Lower bounds on the homology of Vietoris–Rips complexes of hypercube graphsHenry Adams, Žiga Virk, 2024, izvirni znanstveni članek Povzetek: We provide novel lower bounds on the Betti numbers of Vietoris-Rips complexes of hypercube graphs of all dimensions, and at all scales. In more detail, let $Q_n$ be the vertex set of $2^n$ vertices in the $n$-dimensional hypercube graph, equipped with the shortest path metric. Let ${\rm VR}(Q_n;r)$ be its Vietoris-Rips complex at scale parameter $r \ge 0$, which has $Q_n$ as its vertex set, and all subsets of diameter at most $r$ as its simplices. For integers $r < r'$ the inclusion ${\rm VR}(Q_n;r) \hookrightarrow {\rm VR}(Q_n;r')$ is nullhomotopic, meaning no persistent homology bars have length longer than one, and we therefore focus attention on the individual spaces ${\rm VR}(Q_n;r)$. We provide lower bounds on the ranks of homology groups of ${\rm VR}(Q_n;r)$. For example, using cross-polytopal generators, we prove that the rank of $H_{2^r-1}({\rm VR}(Q_n;r))$ is at least $2^{n-(r+1)}\binom{n}{r+1}$. We also prove a version of homology propagation: if $q\ge 1$ and if $p$ is the smallest integer for which ${\rm rank} H_q({\rm VR}(Q_p;r)) \neq 0$, then ${\rm rank} H_q({\rm VR}(Q_n;r)) \ge \sum_{i=p}^n 2^{i-p} \binom{i-1}{p-1} \cdot {\rm rank} H_q({\rm VR}(Q_p;r))$ for all $n \ge p$. When $r \le 3$, this result and variants thereof provide tight lower bounds on the rank of $H_q({\rm VR}(Q_n;r))$ for all $n$, and for each $r \ge 4$ we produce novel lower bounds on the ranks of homology groups. Furthermore, we show that for each $r\ge 2$, the homology groups of ${\rm VR}(Q_n;r)$ for $n \ge 2r+1$ contain propagated homology not induced by the initial cross-polytopal generators.
Ključne besede: Vietoris–Rips complexes, clique complexes, hypercubes, Betti numbers
Objavljeno v DiRROS: 05.03.2024; Ogledov: 135; Prenosov: 40
Celotno besedilo (867,00 KB)
Gradivo ima več datotek! Več... |
