英语翻译
英语翻译
ON THE NUMBER OF CONGRUENCE CLASSES OF PATHS
ZHICONG LIN AND JIANG ZENG
Abstract.Let Pn denote the undirected path of length n − 1.The cardinality of the set of congruence classes induced by the graph homomorphisms from Pn onto Pk is determined.This settles an open problem of Michels and Knauer (Disc.Math.,309 (2009) 5352-5359).Our result is based on a new proven formula of the number of homomorphisms between paths.
Keywords:Graph,graph endomorphisms,graph homomorphisms,paths,lattice paths
1.Introduction
We use standard notations and terminology of graph theory in [3] or [6,Appendix].The graphs considered here are finite and undirected without multiple edges and loops.Given a graph G,we write V (G) for the vertex set and E(G) for the edge set.A homomorphism from a graph G to a graph H is a mapping f :V (G) → V (H) such that the images of adjacent vertices are adjacent.An endomorphism of a graph is a homomorphism from the graph to itself.Denote by Hom(G,H) the set of homomorphisms from G to H and by End(G) the set of endomorphisms of a graph G.For any finite set X we denote by |X| the cardinality of X.A path with n vertices is a graph whose vertices can be labeled v1,...,vn so that vi and vj are adjacent if and only if |i − j| = 1; let Pn denote such a graph with vi = i for 1 ≤ i ≤ n.Every endomorphism f on G induces a partition ρ of V (G),also called the congruence classes induced by f,with vertices in the same block if they have the same image.
Let C (Pn) denote the set of endomorphism-induced partitions of V (Pn),and let |ρ| denote the number of blocks in a partition ρ.For example,if f ∈ End(P4) is defined by f(1) = 3,f(2) = 2,f(3) = 1,f(4) = 2,then the induced partition ρ is {{1},{2,4},{3}} and |ρ| = 3.
The problem of counting the homomorphisms from G to H is difficult in general.How- ever,some algorithms and formulas for computing the number of homomorphisms of paths have been published recently (see [1,2,5]).In particular,Michels and Knauer [5] give an algorithm based on the epispectrum Epi(Pn) of a path Pn.They define Epi(Pn) = (l1(n),...,ln−1(n)),where
lk(n) = |{ρ ∈ C (Pn) :|ρ| = n − k + 1}|.(1.1)
Here a misprint in the definition of lk(n) in [5] is corrected.
In [5],based on the first values of lk(n),Michels and Knauer speculated the following conjecture.
ON THE NUMBER OF CONGRUENCE CLASSES OF PATHS
ZHICONG LIN AND JIANG ZENG
Abstract.Let Pn denote the undirected path of length n − 1.The cardinality of the set of congruence classes induced by the graph homomorphisms from Pn onto Pk is determined.This settles an open problem of Michels and Knauer (Disc.Math.,309 (2009) 5352-5359).Our result is based on a new proven formula of the number of homomorphisms between paths.
Keywords:Graph,graph endomorphisms,graph homomorphisms,paths,lattice paths
1.Introduction
We use standard notations and terminology of graph theory in [3] or [6,Appendix].The graphs considered here are finite and undirected without multiple edges and loops.Given a graph G,we write V (G) for the vertex set and E(G) for the edge set.A homomorphism from a graph G to a graph H is a mapping f :V (G) → V (H) such that the images of adjacent vertices are adjacent.An endomorphism of a graph is a homomorphism from the graph to itself.Denote by Hom(G,H) the set of homomorphisms from G to H and by End(G) the set of endomorphisms of a graph G.For any finite set X we denote by |X| the cardinality of X.A path with n vertices is a graph whose vertices can be labeled v1,...,vn so that vi and vj are adjacent if and only if |i − j| = 1; let Pn denote such a graph with vi = i for 1 ≤ i ≤ n.Every endomorphism f on G induces a partition ρ of V (G),also called the congruence classes induced by f,with vertices in the same block if they have the same image.
Let C (Pn) denote the set of endomorphism-induced partitions of V (Pn),and let |ρ| denote the number of blocks in a partition ρ.For example,if f ∈ End(P4) is defined by f(1) = 3,f(2) = 2,f(3) = 1,f(4) = 2,then the induced partition ρ is {{1},{2,4},{3}} and |ρ| = 3.
The problem of counting the homomorphisms from G to H is difficult in general.How- ever,some algorithms and formulas for computing the number of homomorphisms of paths have been published recently (see [1,2,5]).In particular,Michels and Knauer [5] give an algorithm based on the epispectrum Epi(Pn) of a path Pn.They define Epi(Pn) = (l1(n),...,ln−1(n)),where
lk(n) = |{ρ ∈ C (Pn) :|ρ| = n − k + 1}|.(1.1)
Here a misprint in the definition of lk(n) in [5] is corrected.
In [5],based on the first values of lk(n),Michels and Knauer speculated the following conjecture.
英语人气:491 ℃时间:2019-10-08 05:08:47
优质解答
同余类的路径ZHICONG林,江曾摘要的数量.令Pn表示无向路径长度为n - 1.确定从的Pn到PK的图形同态诱导的同余类的集合的基数.这解决的一个公开问题的的米歇尔斯和克瑙尔(Disc.数学系,309(2009)5352-5359).我们的结...
我来回答
类似推荐
猜你喜欢
- 1如图,在水平桌面上有甲、乙两个内部呈圆柱形的容器,内部底面积分别为80 cm2、100 cm2,且甲容器装满水,乙容器是空的.若将甲中的水全部倒入乙中,则乙中的水位高度比原先甲的水位高
- 2找规律填数.20% 0.3 ( )% ( )成 (
- 3She is taiking to her friend.的疑问句是什么?
- 4The park,____ we met with him,is very nice.A.where B.which C.that D.when
- 5时态问题It was reported that more than one million people ignored light showers
- 6The boss gave me 20% discount,for I was a(an)_______customer of the restaurant.
- 7已知函f(x)是偶函数,而且在(0,+∞)上是增函数,判断f(x)在(-∞,0)上是增函数还是减函数,并证明你的判断.
- 8help和free的过去式和过去分词
- 9把一个长为20厘米,宽为十厘米的长方形绕着他的长旋转一周,所形成的图柱体的体积是多少立方厘米派取3.14.
- 10在△ABC中,设a+c=2b,A-C=π3,求sinB的值.