A note on degree-continuous graphs

Chiang Lin; Wei-Bo Ou

Czechoslovak Mathematical Journal (2007)

  • Volume: 57, Issue: 3, page 1043-1047
  • ISSN: 0011-4642

Abstract

top
The minimum orders of degree-continuous graphs with prescribed degree sets were investigated by Gimbel and Zhang, Czechoslovak Math. J. 51 (126) (2001), 163–171. The minimum orders were not completely determined in some cases. In this note, the exact values of the minimum orders for these cases are obtained by giving improved upper bounds.

How to cite

top

Lin, Chiang, and Ou, Wei-Bo. "A note on degree-continuous graphs." Czechoslovak Mathematical Journal 57.3 (2007): 1043-1047. <http://eudml.org/doc/31181>.

@article{Lin2007,
abstract = {The minimum orders of degree-continuous graphs with prescribed degree sets were investigated by Gimbel and Zhang, Czechoslovak Math. J. 51 (126) (2001), 163–171. The minimum orders were not completely determined in some cases. In this note, the exact values of the minimum orders for these cases are obtained by giving improved upper bounds.},
author = {Lin, Chiang, Ou, Wei-Bo},
journal = {Czechoslovak Mathematical Journal},
keywords = {order; degree-continuous graph; degree set; Erdös-Gallai theorem; regular graph; order; degree-continuous graph; degree set; Erdös-Gallai theorem; regular graph},
language = {eng},
number = {3},
pages = {1043-1047},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {A note on degree-continuous graphs},
url = {http://eudml.org/doc/31181},
volume = {57},
year = {2007},
}

TY - JOUR
AU - Lin, Chiang
AU - Ou, Wei-Bo
TI - A note on degree-continuous graphs
JO - Czechoslovak Mathematical Journal
PY - 2007
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 57
IS - 3
SP - 1043
EP - 1047
AB - The minimum orders of degree-continuous graphs with prescribed degree sets were investigated by Gimbel and Zhang, Czechoslovak Math. J. 51 (126) (2001), 163–171. The minimum orders were not completely determined in some cases. In this note, the exact values of the minimum orders for these cases are obtained by giving improved upper bounds.
LA - eng
KW - order; degree-continuous graph; degree set; Erdös-Gallai theorem; regular graph; order; degree-continuous graph; degree set; Erdös-Gallai theorem; regular graph
UR - http://eudml.org/doc/31181
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.