Highly irregular graphs with extreme numbers of edges
type: Item
instance of: scholarly article
title: Highly irregular graphs with extreme numbers of edges
zbMATH Open document ID: 0883.05082
DOI: 10.1016/S0012-365X(96)00056-8
author: Zofia Majcher
author: Jerzy Michael
published in: Discrete Mathematics
publication date: 1997-06-10T00:00:00Z
review text: A graph is highly irregular if the neighbours of each vertex have distinct degrees. The authors determine the largest number of edges of a highly irregular graph with an odd number of vertices (the same problem had been solved in 1987 for graphs with an even number of vertices by Alavi, Chartrand, Chung, Erdös, Graham and Oellermann). The authors also determine the smallest number of edges in a highly irregular graph of any given order.
reviewed by: Ortrud R. Oellermann
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 1019067
zbMATH Keywords: number of edges
zbMATH Keywords: highly irregular graph
MaRDI profile type: Publication
cites work: Highly irregular graphs
cites work: Degree sequences of highly irregular graphs
full work available at URL: s0012-365x(96)00056-8
OpenAlex ID: W2085393097
Recommended article: Highly irregular graphs
Recommended article: Q5403614
Recommended article: Highly irregular bipartite graphs
Recommended article: Graphs with maximal irregularity
Recommended article: Graphs with maximum irregularity
Recommended article: Q3139857
Recommended article: Q4957161
Recommended article: Q3201103
Recommended article: Highly irregular m-chromatic graphs
Recommended article: Degree sequences of highly irregular graphs
description: scientific article; zbMATH DE number 1019067