On graphs with the same restricted U-polynomial and the U-polynomial for rooted graphs

Q2 Mathematics Electronic Notes in Discrete Mathematics Pub Date : 2018-07-01 DOI:10.1016/j.endm.2018.06.032

José Aliste-Prieto , José Zamora , Anna de Mier

引用次数: 1

Abstract

In this abstract, we construct explicitly, for every k, pairs of non-isomorphic trees with the same restricted U-polynomial; by this we mean that the polynomials agree on terms with degree at most k. The construction is done purely in algebraic terms, after introducing and studying a generalization of the U-polynomial to rooted graphs.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

具有相同限制u -多项式的图和有根图的u -多项式

在这个摘要中，我们明确地构造了，对于每k，具有相同受限u -多项式的非同构树对;通过这一点，我们的意思是多项式在次数最多为k的项上一致。在引入并研究了u多项式对有根图的推广之后，纯粹在代数项上进行了构造。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Electronic Notes in Discrete Mathematics Mathematics-Discrete Mathematics and Combinatorics

CiteScore

1.30

自引率

0.00%

发文量

期刊介绍： Electronic Notes in Discrete Mathematics is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication is appropriate. Organizers of conferences whose proceedings appear in Electronic Notes in Discrete Mathematics, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.

期刊最新文献

Preface Minimal condition for shortest vectors in lattices of low dimension Enumerating words with forbidden factors Polygon-circle and word-representable graphs On an arithmetic triangle of numbers arising from inverses of analytic functions