On the classification and toughness of generalized permutation star-graphs

Chong-Yun Chao; Shaocen Han

Czechoslovak Mathematical Journal (1997)

  • Volume: 47, Issue: 3, page 431-452
  • ISSN: 0011-4642

Abstract

top
We use an algebraic method to classify the generalized permutation star-graphs, and we use the classification to determine the toughness of all generalized permutation star-graphs.

How to cite

top

Chao, Chong-Yun, and Han, Shaocen. "On the classification and toughness of generalized permutation star-graphs." Czechoslovak Mathematical Journal 47.3 (1997): 431-452. <http://eudml.org/doc/30374>.

@article{Chao1997,
abstract = {We use an algebraic method to classify the generalized permutation star-graphs, and we use the classification to determine the toughness of all generalized permutation star-graphs.},
author = {Chao, Chong-Yun, Han, Shaocen},
journal = {Czechoslovak Mathematical Journal},
keywords = {generalized permutation graph; star graph; toughness of a graph},
language = {eng},
number = {3},
pages = {431-452},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {On the classification and toughness of generalized permutation star-graphs},
url = {http://eudml.org/doc/30374},
volume = {47},
year = {1997},
}

TY - JOUR
AU - Chao, Chong-Yun
AU - Han, Shaocen
TI - On the classification and toughness of generalized permutation star-graphs
JO - Czechoslovak Mathematical Journal
PY - 1997
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 47
IS - 3
SP - 431
EP - 452
AB - We use an algebraic method to classify the generalized permutation star-graphs, and we use the classification to determine the toughness of all generalized permutation star-graphs.
LA - eng
KW - generalized permutation graph; star graph; toughness of a graph
UR - http://eudml.org/doc/30374
ER -

References

top
  1. 10.1090/S0002-9947-1965-0177031-6, Trans. Amer. Math. Soc. 118 (1965), 488–497. (1965) Zbl0129.39704MR0177031DOI10.1090/S0002-9947-1965-0177031-6
  2. 10.1090/S0002-9947-1971-0279000-7, Trans. Amer. Math. Soc. 158 (1971), 247–257. (1971) Zbl0217.02403MR0279000DOI10.1090/S0002-9947-1971-0279000-7
  3. Planar permutation graphs, Ann. Inst. Henri Poincaré III 4 (1967), 433–438. (1967) MR0227041
  4. 10.1016/0012-365X(73)90138-6, Discrete Math 5 (1973), 215–228. (1973) DOI10.1016/0012-365X(73)90138-6
  5. Automorphisms and Isomorphisms of Permutation Graphs, Colloques Inter., C.N.R.S., Problemes Combinatorics et Theorie des Graphs vol. 260, 1978, pp. 109–110. (1978) MR0539953
  6. On mapping graphs and permutation graphs, Math. Slovaca 3. 28 (1978), 277–288. (1978) MR0534995
  7. 10.1007/BF01258190, Commentarii Mathematici Helvetici 9 (1938), 217–223. (1938) DOI10.1007/BF01258190
  8. Some problems in permutation graphs, Lecture Notes in Mathematics 452, In: Combinatorial Mathematics III, Springer-Verlag, Berlin, 1975, pp. 143–155. (1975) MR0371740
  9. 10.1016/0012-365X(84)90007-4, Discrete Math. 51 (1984), 265–275. (1984) Zbl0559.05053MR0762319DOI10.1016/0012-365X(84)90007-4
  10. 10.1007/BF01864155, Graphs and Combinatorics 4 (1988), . (1988) MR0922162DOI10.1007/BF01864155

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.