Degree polynomial for vertices in a graph and its behavior under graph operations

From MaRDI portal
Publication:6167974

DOI10.14712/1213-7243.2023.006arXiv2009.00488OpenAlexW3082232217MaRDI QIDQ6167974FDOQ6167974


Authors: Reza Jafarpour-Golzari Edit this on Wikidata


Publication date: 8 August 2023

Published in: Commentationes Mathematicae Universitatis Carolinae (Search for Journal in Brave)

Abstract: In this paper, we introduce a new concept namely degree polynomial for vertices of a simple graph. This notion leads to a concept namely degree polynomial sequence which is stronger than the concept of degree sequence. After obtaining the degree polynomial sequence for some well-known graphs, we prove a theorem which gives a necessary condition for realizability of a sequence of polynomials with coefficients in positive integers. Also we calculate the degree polynomial for vertises of join, Cartesian product, tensor product, and lexicographic product of two simple graphs and for vertices of the complement of a simple graph. Some examples, counterexamples, and open problems concerning to this subjects, is given as well


Full work available at URL: https://arxiv.org/abs/2009.00488




Recommendations




Cites Work


Cited In (1)





This page was built for publication: Degree polynomial for vertices in a graph and its behavior under graph operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6167974)