6533b836fe1ef96bd12a0a5d
RESEARCH PRODUCT
Highly irregular graphs with extreme numbers of edges
Jerzy MichaelZofia Majchersubject
Discrete mathematicsPseudoforestHighly irregular graphEdge-graceful labelingTheoretical Computer ScienceHypercube graphCombinatoricsCycle graphDiscrete Mathematics and CombinatoricsPath graphMultiple edgesComplement graphMathematicsofComputing_DISCRETEMATHEMATICSMathematicsdescription
Abstract 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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 1997-02-01 | Discrete Mathematics |