【摘 要】
：
A proper edge coloring of a graph G is called adjacent vertex distinguishing, if any pair of adjacent vertices meets distinct color sets.The adjacent vertex dis
【机 构】
：
ZhejiangNormalUniversity
论文部分内容阅读
A proper edge coloring of a graph G is called adjacent vertex distinguishing, if any pair of adjacent vertices meets distinct color sets.The adjacent vertex distinguishing index of G, denoted by xa(G), is the smallest integer k such that G has a k-adjacent vertex distinguishing edge coloring.[K.Edwards, M.Hornak and M.Wozniak, On the neighbor distinguishing index of a graph, Graphs Combin.22 (2006) 341-350] showed thatxa(G)≤ △ + 1 for any bipartite planar graph G with △≥ 12.
其他文献
Tutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow.In this talk, we show that this conjecture is true for Cayley graphs on some sp
近日,据不完全统计,今年前五个月中,有二十多地出台房屋租赁新规,包括房源、租金、安全、监管和户籍登记等诸多方面.rn9地保障租赁住房供应rn58安居客房产研究院近日发布重点
Let G be a simple graph of order n and μ1,μ2,… ,μn the roots of its matching polynomial.The matching energy of G is defined as the sum Σn i=1 |μi|.In this
A graph Γ is called s-regular if b acts regularly on its s-arcs.Γ =Cay(G, S) is said to be core-free if G is core-free in some X for G ≤ X ≤ b.It is shown i
In 1976, Thomassen C.conjectures that every longest cycle in a 3-connected graph has a chord (see Bondy J.A., Murty U.S.R., Graph theory, Graduate Texts in Math
For positive integers k and r, an (k, r)-coloring of a graph G is a proper k-coloring of the vertices such that every vertex of degree i will be adjacent to ver
组合矩阵的指数理论是组合矩阵论中核心的研究内容,其不仅具有重要的理论价值,而且在计算机科学、遍历理论、通讯理论、社会学和经济学中都有广泛的应用.注意到:组合矩阵的各
近日,中国民用航空局发布《关于调整国际客运航班的通知》(下称《通知》),外国航空公司可有限制地执行国际客运航线航班.相关负责人介绍,国际客运航班调整后,预计目前保持通
“Shall”是法律英语中使用频率最高的情态动词,也是涉及纠纷最多的情态动词.关于“shall”用法的现有研究主要从语言学和翻译学角度进行探讨,集中讨论了shall表强制性义务的
Since Gauss firstly proved quadratic reciprocity law in 1796, there are almost 200 proves about it nowadays.With the great zeal to quadratic residue theorem, th