On isopart parameters of complete bipartite graphs and n -cubes

Richard M. Davitt; John Frederick Fink; Michael S. Jacobson

Mathematica Slovaca (1985)

  • Volume: 35, Issue: 4, page 409-415
  • ISSN: 0232-0525

How to cite

top

Davitt, Richard M., Fink, John Frederick, and Jacobson, Michael S.. "On isopart parameters of complete bipartite graphs and $n$-cubes." Mathematica Slovaca 35.4 (1985): 409-415. <http://eudml.org/doc/32217>.

@article{Davitt1985,
author = {Davitt, Richard M., Fink, John Frederick, Jacobson, Michael S.},
journal = {Mathematica Slovaca},
keywords = {minimum order; minimum degree of regularity; decomposable graphs; connected regular graph; complete bipartite graphs; n-cube},
language = {eng},
number = {4},
pages = {409-415},
publisher = {Mathematical Institute of the Slovak Academy of Sciences},
title = {On isopart parameters of complete bipartite graphs and $n$-cubes},
url = {http://eudml.org/doc/32217},
volume = {35},
year = {1985},
}

TY - JOUR
AU - Davitt, Richard M.
AU - Fink, John Frederick
AU - Jacobson, Michael S.
TI - On isopart parameters of complete bipartite graphs and $n$-cubes
JO - Mathematica Slovaca
PY - 1985
PB - Mathematical Institute of the Slovak Academy of Sciences
VL - 35
IS - 4
SP - 409
EP - 415
LA - eng
KW - minimum order; minimum degree of regularity; decomposable graphs; connected regular graph; complete bipartite graphs; n-cube
UR - http://eudml.org/doc/32217
ER -

References

top
  1. BEHZAD M., CHARTRAND G., LESNIAK-FOSTER L., Graphs & Digraphs, Wadsworth International, Belmont, CA, 1979. (1979) Zbl0403.05027MR0525578
  2. FINK J. F., Every graph is an induced isopart of a connected regular graph, Submitted for publication. 
  3. FINK J. F., On smallest regular graphs with a given isopart, Submitted for publication. Zbl0607.05039
  4. FINK J. F., RUIZ S., Every graph is an induced isopart of a circulant, Submitted for publication. Zbl0614.05052
  5. KÖNIG D., Über Graphen und ihre Anwendung auf Determinantentheorie and Mengenlehre, Math. Ann. 77, 1916, 453-465. (1916) MR1511872
  6. PETERSEN J., Die Theorie der regularen Graphen, Acta Math. 15, 1891, 193-220. MR1554815
  7. REISS M., Über eine Steinersche kombinatorische Aufgabe, J. reine u. ang. Mathematik 56,1859, 326-344. 
  8. WILSON R. M., Decompositions of complete graphs into subgraphs isomorphic to a given graph, Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen, 1975) 647-659. Congressus Numerantium, No. XV, Utilitas Math., Winnipeg, Man. (1976). (1975) MR0396347

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.