Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(1)
Connected Graph
Subscribe
Academic
Publications
Highly irregular graphs with extreme numbers of edges
Highly irregular graphs with extreme numbers of edges,10.1016/S0012365X(96)000568,Discrete Mathematics,Zofia Majcher,Jerzy Michael
Edit
Highly irregular graphs with extreme numbers of edges
BibTex

RIS

RefWorks
Download
Zofia Majcher
,
Jerzy Michael
A simple
connected graph
is highly irregular if each of its vertices is adjacent only to vertices with distinct degrees. In this paper we find: (1) the greatest number of edges of a highly irregular graph with n vertices, where n is an odd integer (for n even this number is given in [1]), (2) the smallest number of edges of a highly irregular graph of given order.
Journal:
Discrete Mathematics  DM
, vol. 164, no. 13, pp. 237242, 1997
DOI:
10.1016/S0012365X(96)000568
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.sciencedirect.com
)
(
dx.doi.org
)
(
www.informatik.unitrier.de
)
(
linkinghub.elsevier.com
)
More »
References
(2)
Highly irregular graphs
(
Citations: 9
)
Yousef Alavi
,
Gary Chartrand
,
F. R. K. Chung
,
R. L. Graham
,
Ortrud R. Oellermann
Journal:
Journal of Graph Theory  JGT
, vol. 11, no. 2, pp. 235249, 1987
Degree sequences of highly irregular graphs
(
Citations: 2
)
Zofia Majcher
,
Jerzy Michael
Journal:
Discrete Mathematics  DM
, vol. 164, no. 13, pp. 225236, 1997