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

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

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)

Cites Work

• Unnamed Item
• Unnamed Item
• The effect of random edge removal on network degree sequence
• A simple criterion on degree sequences of graphs
• Contributions to the theory of graphic sequences
• Relations between graphs and integer-pair sequences
• Realizability and uniqueness in graphs
• Some applications of graph theory to finite groups
• Neighborhood degree lists of graphs
• A remark on the existence of finite graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Generation and analysis of networks with a prescribed degree sequence and subgraph family: higher-order structure matters

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