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

DOI10.14712/1213-7243.2023.006MaRDI QIDQ6167974zbMATH OpenOpenAlexFDO

Authors Reza Jafarpour-Golzari

Publication date 8 August 2023

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

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

zbMATH Keywords

degree sequencegraph operationdegree polynomialdegree polynomial sequence

Mathematics Subject Classification ID

Graph polynomials (05C31) Vertex degrees (05C07) Graph operations (line graphs, products, etc.) (05C76)

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

Recommendations

• The vertex degree polynomial of some graph operations
• Degree sequences of join and corona products of graphs
• On realization graphs of degree sequences
• On the differential polynomial of a graph
• The lattice polynomial of a graph.

Cites work

• scientific article; zbMATH DE number 3169205 (Why is no real title available?)
• A remark on the existence of finite graphs
• A simple criterion on degree sequences of graphs
• Contributions to the theory of graphic sequences
• Generation and analysis of networks with a prescribed degree sequence and subgraph family: higher-order structure matters
• Graph theory with applications
• Neighborhood degree lists of graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Realizability and uniqueness in graphs
• Relations between graphs and integer-pair sequences
• Some applications of graph theory to finite groups
• The effect of random edge removal on network degree sequence

Cited in

(1)

• The vertex degree polynomial of some graph operations

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)