Degree sets of degree uniform graphs

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1985 English Publisher:Springer Science and Business Media LLCJournal:Graphs and Combinatorics, volume 1, pages 283-290 (issn: 0911-0119, eissn: 1435-5914,

Copyright policy )

Authors: Christina M. Mynhardt;

doi: 10.1007/bf02582953

Degree sets of degree uniform graphs

- Summary
- Subjects
- Metrics

Abstract

A graph G is n-degree uniform if for every nonnegative integer r, there are either no vertices of degree r or n vertices of degree r. For any integer \(n\geq 2\), a necessary and sufficient condition for a (finite, nonempty) set of positive integers to be the degree set of an n-degree uniform graph is given.

Related Organizations

University of South Africa
South Africa

Keywords

Graph theory, degree uniform graph, degree set

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	1
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average