arXiv math/05092962005-09-14math.CO

The distinguishing number of the iterated line graph

Ian Shipman

备注：: 10 pages, 2 figures

英文摘要：

We show that for all simple graphs G other than the cycles C_3,C_4,C_5, and the claw K_1,3 there exists a K > 0 such that whenever k > K the k-th iterate of the line graph can be distinguished by at most two colors. Additionally we determine, for trees, when the distinguishing number of the line graph of T is greater than the distinguishing number of T.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

On traceable iterated line graph and hamiltonian path index

Xiong and Liu [L. Xiong and Z. Liu, Hamiltonian iterated line graphs, Discrete Math. 256 (2002) 407-422] gave a characterization of the graphs $G$ for which the $n$-th iterated line graph $L^n(G)$ is hamiltonian, for $n\ge2$. In this paper, we study the existence of a hamiltonian path in $L^n(G)$, and give a characterization of $G$ for which $L^n(G)$ has a hamiltonian path. As applications, we use this characterization to give several upper bounds on the hamiltonian path index of a graph.

2020-12-28math.CO

Zero forcing in iterated line digraphs

Zero forcing is a propagation process on a graph, or digraph, defined in linear algebra to provide a bound for the minimum rank problem. Independently, zero forcing was introduced in physics, computer science and network science, areas where line digraphs are frequently used as models. Zero forcing is also related to power domination, a propagation process that models the monitoring of electrical power networks. In this paper we study zero forcing in iterated line digraphs and provide a relationship between zero forcing and power domination in line digraphs. In particular, for regular iterated…

2018-10-23math.CO

A note on the order of iterated line digraphs

Given a digraph $G$, we propose a new method to find the recurrence equation for the number of vertices $n_k$ of the $k$-iterated line digraph $L^k(G)$, for $k\geq0$, where $L^0(G)=G$. We obtain this result by using the minimal polynomial of a quotient digraph $π(G)$ of $G$. We show some examples of this method applied to the so-called cyclic Kautz, the unicyclic, and the acyclic digraphs. In the first case, our method gives the enumeration of the ternary length-2 squarefree words of any length.

2016-07-29math.CO

Iterated Point-Line Configurations Grow Doubly-Exponentially

Begin with a set of four points in the real plane in general position. Add to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu and Radoičić (2003) showed that the limiting set is dense in the plane. We give doubly exponential upper and lower bounds on the number of points at each stage. The proof employs a variant of the Szemerédi-Trotter Theorem and an analysis of the ``minimum degree'' of the growing configuration.

2008-07-09math.CO

有向图的若干内度量参数：迭代线有向图与整数序列

Some inner metric parameters of a digraph: Iterated line digraphs and integer sequences

本文研究有向图的内直径与内半径在迭代线有向图中的演化规律，提出刻画相关整数序列的方法，并应用于 Kautz 有向图、无平方有向图及 De Bruijn 子图，发现若干新整数序列。

2024-09-01math.CO

迭代线图中的哈密顿路径

Hamiltonian paths in iterated line graphs

University of West Bohemia（西波希米亚大学）；European Centre of Excellence NTIS - New Technologies for the Information Society, Faculty of Applied Sciences, University of West Bohemia（西波希米亚大学应用科学学院信息社会新技术卓越中心）

本文研究了图的迭代线图中哈密顿路径的存在性，定义了哈密顿路径指数，并探讨了树和具有哈密顿2连通块的图的性质。

2026-03-05math.CO

更多相关论文收起更多论文

The distinguishing number and the distinguishing index of line and graphoidal graphs

The distinguishing number (index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (edge labeling) with $d$ labels that is preserved only by a trivial automorphism. A graphoidal cover of $G$ is a collection $ψ$ of (not necessarily open) paths in $G$ such that every path in $ψ$ has at least two vertices, every vertex of $G$ is an internal vertex of at most one path in $ψ$ and every edge of $G$ is in exactly one path in $ψ$. Let $Ω(G,ψ)$ denote the intersection graph of $ψ$. A graph $H$ is called a graphoidal graph, if there exists a graph $G$ and a g…

2017-08-19math.CO

具有仅负特征值-2的迭代线图及其补图和能量

Iterated line graphs with only negative eigenvalues $-2$, their complements and energy

本文研究了具有仅负特征值-2的迭代线图及其补图的谱和能量特性，并推广了部分现有结果。

2024-09-21math.CO

The distinguishing number and distinguishing chromatic number for posets

In this paper we introduce the concepts of the distinguishing number and the distinguishing chromatic number of a poset. For a distributive lattice $L$ and its set $Q_L$ of join-irreducibles, we use classic lattice theory to show that any linear extension of $Q_L$ generates a distinguishing 2-coloring of $L$. We prove general upper bounds for the distinguishing chromatic number and particular upper bounds for the Boolean lattice and for divisibility lattices. In addition, we show that the distinguishing number of any twin-free Cohen-Macaulay planar lattice is at most 2.

2020-07-08math.CO

关于迭代线图的二阶 Wiener 比

On the Second-Order Wiener Ratios of Iterated Line Graphs

针对迭代线图二阶 Wiener 比的猜想，本文证明对每个 n>21 都存在树，使 R_2 小于路径 P_n，从而给出反例。

2024-01-22math.CO

Index of Parameters of Iterated Line Graphs

Let $G$ be a prolific graph, that is a finite connected simple graph which is not isomorphic to a cycle nor a path nor the star graph $K_{1,3}$. The line-graph of $G$, denoted by $L(G)$, is defined by having its vertex-set equal to the edge-set of $G$ and two vertices of $L(G)$ are adjacent if the corresponding edges are adjacent in $G$. For a positive integer $k$, the iterated line-graph $L^k(G)$ is defined recursively by $L^k(G)=L(L^{k-1}(G))$. We consider fifteen graph parameters and study their behaviour when the operation of taking the line-graph is iterated. We shall first show that all …

2022-01-13math.CO

Asymptotic syzygies of Stanley-Reisner rings of iterated subdivisions

Inspired by recent results of Ein, Lazarsfeld, Erman and Zhou on the non-vanishing of Betti numbers of high Veronese subrings, we describe the behaviour of the Betti numbers of Stanley-Reisner rings associated with iterated barycentric or edgewise subdivisions of a given simplicial complex. Our results show that for a simplicial complex $Δ$ of dimension $d-1$ and for $1\leq j\leq d-1$ the number of $0$'s the j-th linear strand of the minimal free resolution of the r-th barycentric or edgewise subdivision is bounded above only in terms of $d$ and $j$ (and independently of $r$).

2014-12-09math.ACmath.CO

The maximum distinguishing number of a group

Let G be a group acting faithfully on a set X. The distinguishing number of the action of G on X is the smallest number of colors such that there exists a coloring of X where no nontrivial group element induces a color-preserving permutation of X. In this paper, we show that if G is nilpotent of class c or supersolvable of length c then G always acts with distinguishing number at most c+1. We obtain that all metacyclic groups act with distinguishing number at most 3; these include all groups of squarefree order. We also prove that the distinguishing number of the action of the general linear g…

2006-01-14math.COmath.GR