当前位置:
X-MOL 学术
›
Appl. Math. Comput.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Proper connection and proper-walk connection of digraphs
Applied Mathematics and Computation ( IF 4 ) Pub Date : 2021-04-27 , DOI: 10.1016/j.amc.2021.126253 Anna Fiedorowicz , Elżbieta Sidorowicz , Éric Sopena
中文翻译:
有向图的正确连接和正确的行走连接
更新日期:2021-04-28
Applied Mathematics and Computation ( IF 4 ) Pub Date : 2021-04-27 , DOI: 10.1016/j.amc.2021.126253 Anna Fiedorowicz , Elżbieta Sidorowicz , Éric Sopena
An arc-colored digraph is properly (properly-walk) connected if, for any ordered pair of vertices the digraph contains a directed path (a directed walk) from to such that arcs adjacent on that path (on that walk) have distinct colors. The proper connection number (the proper-walk connection number ) of a digraph is the minimum number of colours to make properly connected (properly-walk connected). We prove that for every circulant digraph with and . Furthermore, we give some sufficient conditions for a Hamiltonian digraph to satisfy .
中文翻译:
有向图的正确连接和正确的行走连接
圆弧形的有向图 对于任何有序的顶点对,是否正确连接(正确行走) 图 包含来自的定向路径(定向步行) 至 这样,在该路径上(在该行人道上)相邻的弧线会具有不同的颜色。正确的连接号 (正确的步行连接号 图) 是要制作的最小颜色数 正确连接(正确步行连接)。我们证明 对于每个循环图 和 和 。此外,我们给出了哈密顿图的一些充分条件 为了满足 。