Combinatorics (math.CO)

Abstract: A Random walk labeling of a graph $G$ is any labeling of $G$ that could have been obtained by performing a random walk on $G$. Continuing two recent works, we calculate the number of random walk labelings of perfect trees, combs, and double combs, the torus $C_2\times C_n$, and the graph obtained by connecting three path graphs to form two cycles.

Abstract: In this brief communication, we investigate the cospectral as well integral chain graphs for Seidel matrix, a key component to study the structural properties of equiangular lines in space. We derive a formula that allows to generate an infinite number of inequivalent chain graphs with identical spectrum. In addition, we obtain a family of Seidel integral chain graphs. This contrapositively answers a problem posed by Greaves ["Equiangular line systems and switching classes containing regular graphs", Linear Algebra Appl., (2018)] ("Does every Seidel matrix with precisely three distinct rational eigenvalues contain a regular graph in its switching class?"). Our observation is- "no".

Abstract: Let $p_n$ be the maximal sum of the entries of $A^2$, where $A$ is a square matrix of size $n$, consisting of the numbers $1,2,\ldots,n^2$, each appearing exactly once. We prove that $m_n=\Theta(n^7)$. More precisely, we show that $n(240n^{6}+28n^{5}+364n^{4}+210n^{2}-28n+26-105((-1)^{n}+1))/840\leq p_n\leq n^{3}(n^{2}+1)(7n^{2}+5)/24$.

Abstract: A vertex coloring of a graph $G$ is called a 2-distance coloring if any two vertices at a distance at most $2$ from each other receive different colors. Suppose that $G$ is a planar graph with girth $5$ and maximum degree $\Delta$. We prove that $G$ admits a $2$-distance $\Delta+7$ coloring, which improves the result of Dong and Lin (J. Comb. Optim. 32(2), 645-655, 2016). Moreover, we prove that $G$ admits a $2$-distance $\Delta+6$ coloring when $\Delta\geq 10$.

Abstract: Let $\mathcal T (n, k)$ be the set of the $k$-uniform supertrees with $n$ vertices and $m$ edges, where $k\geq 3$, $n\geq 5$ and $m=\frac{n-1}{k-1}$. % Let $m$ be the number of the edges of the supertrees in $\mathcal T (n, k)$, where $m=\frac{n-1}{k-1}$. A conjecture concerning the supertrees with the fourth through the eighth largest $\alpha$-spectral radii in $\mathcal T (n, k)$ was proposed by You et al.\ (2020), where $0 \leq \alpha<1$, $k\geq 3$ and $m \geq 10$. This conjecture was partially solved for $1-\frac{1}{m-2}\leq \alpha <1$ and $m\geq 10$ by Wang et al.\ (2022). When $0\leq \alpha <1-\frac{1}{m-2}$ and $m \geq 10$, whether this conjecture is correct or not remains a problem to be further solved. By using a new $\rho_{\alpha}$-normal labeling method proposed in this article for computing the $\alpha$-spectral radius of the $k$-uniform hypergraphs, we completely prove that this conjecture is right for $0\leq\alpha<1$ and $m\geq 13$.

Abstract: The height $H(n)$ of $n$, is the smallest positive integer $i$ such that the $i$ th iterate of the totient function evaluated at $n$ is $1$. H. N. Shapiro determined that $H$ was almost completely additive. Building on the fact that the set of all numbers at a particular height reflect a partition structure the paper shows that all multi-partition structures correspond to a completely additive function. This includes the Matula number for rooted trees, as well as the sum of the primes function studied by Alladi and Erdos. We show the reordering of the natural numbers in each such partition structure is of importance and conjecture that the log of the asymptotic growth of the multi-partition is inversely related to the order of the growth of the associated additive function. We further provide computational evidence that the partition structure for large n tends to a lognormal distribution leading to insights into the distribution of primes at each height, which can thus be seen as a finite setting for probabilistic questions.

Abstract: Given a fixed graph $H$ and an $n$-vertex graph $G$, the $H$-bootstrap percolation process on $G$ is defined to be the sequence of graphs $G_i$, $i\geq 0$ which starts with $G_0:=G$ and in which $G_{i+1}$ is obtained from $G_i$ by adding every edge that completes a copy of $H$. We are interested in the maximum number of steps, over all $n$-vertex graphs $G$, that this process takes to stabilise. In the first of a series of papers exploring the behaviour of this function, denoted $M_H(n)$, and its dependence on certain properties of $H$, we investigate the case when $H$ is a cycle. We determine the running time precisely, giving the first infinite family of graphs $H$ for which an exact solution is known. The maximum running time of the $C_k$-bootstrap process is of the order $\log_{k-1}(n)$ for all $3\leq k\in \mathbb{N}$. Interestingly though, the function exhibits different behaviour depending on the parity of $k$ and the exact location of the values of $n$ for which $M_H(n)$ increases is determined by the Frobenius number of a certain numerical semigroup depending on $k$.

Abstract: This manuscript includes some classical results we select apart from the new results we've found on the Analysis of Boolean Functions and Fourier-Entropy-Influence conjecture. We try to ensure the self-completeness of this work so that readers could probably read it independently. Among the new results, what is the most remarkable is that we prove that the entropy of a boolean function $f$ could be bounded by $O(I(f))-O(\sum_{k\in [n]}I_k(f)\log I_k(f))$.

Abstract: In this paper we give a way of equipping the derivation algebra of a group algebra with the structure of a graded algebra. The derived group is used as the grading group. For the proof, the identification of the derivation with the characters of the adjoint action groupoid is used. These results also allow us to obtain the analogous structure of a graded algebra for outer derivations. A non-trivial graduation is obtained for all groups that are not perfect.

Abstract: Let $G$ be a graph. A subset $D \subseteq V(G)$ is called a 1-isolating set of $G$ if $\Delta(G-N[D]) \leq 1$, that is, $G-N[D]$ consists of isolated edges and isolated vertices only. The $1$-isolation number of $G$, denoted by $\iota_1(G)$, is the cardinality of a smallest $1$-isolating set of $G$. In this paper, we prove that if $G \notin \{P_3,C_3,C_7,C_{11}\}$ is a connected graph of order $n$ without $6$-cycles, or without induced 5- and 6-cycles, then $\iota_1(G) \leq \frac{n}{4}$. Both bounds are sharp.

Abstract: A theorem of R\"odl states that for every fixed $F$ and $\varepsilon>0$ there is $\delta=\delta_F(\varepsilon)$ so that every induced $F$-free graph contains a vertex set of size $\delta n$ whose edge density is either at most $\varepsilon$ or at least $1-\varepsilon$. R\"odl's proof relied on the regularity lemma, hence it supplied only a tower-type bound for $\delta$. Fox and Sudakov conjectured that $\delta$ can be made polynomial in $\varepsilon$, and a recent result of Fox, Nguyen, Scott and Seymour shows that this conjecture holds when $F=P_4$. In fact, they show that the same conclusion holds even if $G$ contains few copies of $P_4$. In this note we give a short proof of a more general statement.

Abstract: Given graphs $H_1, H_2$, a \{red, blue\}-coloring of the edges of a graph $G$ is a critical coloring if $G$ has neither a red $H_1$ nor a blue $H_2$. A non-complete graph $G$ is $(H_1, H_2)$-co-critical if $G$ admits a critical coloring, but $G+e$ has no critical coloring for every edge $e$ in the complement of $G$. Motivated by a conjecture of Hanson and Toft from 1987, we study the minimum number of edges over all $(C_4, K_{1,k})$-co-critical graphs on $n$ vertices. We show that for all $k \ge 2$ and $n \ge k +\lfloor \sqrt {k-1} \rfloor +2$, if $G$ is a $(C_4,K_{1,k})$-co-critical graph on $n$ vertices, then $$e(G) \ge \frac{(k+2)n}2-3- \frac{(k-1)(k+ \lfloor \sqrt {k-2}\rfloor)}2.$$ Moreover, this linear bound is asymptotically best possible for all $k\ge3$ and $n\ge3k+4$. It is worth noting that our constructions for the case when $k$ is even have at least three different critical colorings. For $k=2$, we obtain the sharp bound for the minimum number of edges of $(C_4, K_{1,2})$-co-critical graphs on $n\ge5$ vertices by showing that all such graphs have at least $2n-3$ edges. Our proofs rely on the structural properties of $(C_4,K_{1,k})$-co-critical graphs and a result of Ollmann on the minimum number of edges of $C_4$-saturated graphs.