Induced subgraphs with the same order and size

Juraj Bosák

Mathematica Slovaca (1983)

  • Volume: 33, Issue: 1, page 105-119
  • ISSN: 0232-0525

How to cite

top

Bosák, Juraj. "Induced subgraphs with the same order and size." Mathematica Slovaca 33.1 (1983): 105-119. <http://eudml.org/doc/34152>.

@article{Bosák1983,
author = {Bosák, Juraj},
journal = {Mathematica Slovaca},
keywords = {induced subgraphs; pseudosimilar vertices; quasicomplete graph; loopless multigraph},
language = {eng},
number = {1},
pages = {105-119},
publisher = {Mathematical Institute of the Slovak Academy of Sciences},
title = {Induced subgraphs with the same order and size},
url = {http://eudml.org/doc/34152},
volume = {33},
year = {1983},
}

TY - JOUR
AU - Bosák, Juraj
TI - Induced subgraphs with the same order and size
JO - Mathematica Slovaca
PY - 1983
PB - Mathematical Institute of the Slovak Academy of Sciences
VL - 33
IS - 1
SP - 105
EP - 119
LA - eng
KW - induced subgraphs; pseudosimilar vertices; quasicomplete graph; loopless multigraph
UR - http://eudml.org/doc/34152
ER -

References

top
  1. AKIYAMA J., EXOO G., HARARY F., The graphs with all induced subgraphs isomorphic, Bull Malaysian Math. Soc. (2) 2, 1979, 43-44. (1979) Zbl0406.05058MR0545802
  2. BOSÁK J., Induced subgraphs, In: Proceedings of the Sixth Hungarium Colloquium on Combinatorics (Eger 1981), sumbitted. (1981) 
  3. HARARY F., PALMER E., A note on similar points and similar lines of a graph, Rex. Roum. Math. Pures et Appl. 10, 1965, 1489-1492. (1965) Zbl0141.21403MR0197346
  4. HARARY F., PALMER E., on similar points of a graph, J. Math. Mech. 15, 1966, 623-630. (1966) Zbl0141.21404MR0194354
  5. KIMBLE R. J., SCHWENK A. J., STOCKMEYER P. K., Pseudosimilar vertices in a graph, J. Graph Theory 5, 1981, 171-181. (1981) MR0615005
  6. KOCAY W. L., On pseudo-similar vertices, Ars Combinatoria 10, 1980, 147-163. (1980) Zbl0454.05049MR0598908
  7. KRISHNAMOORTHY V., PARTHASARATHY K. R., Cospectral graphs and digraphs with given automorphism group, J. Combinatorial Theory B 19, 1975, 204-213. (1975) Zbl0285.05108MR0398884
  8. MANVEL B., REYNER S. W., Subgraph-equivalence of graphs, J. Combinatorics Information Syst. Sci. 1, 1976, 41-47. (1976) Zbl0402.05056MR0505871
  9. McKAY B. D., Computer reconstruction of small graphs, J. Graph Theory 1, 1977, 281-283. (1977) Zbl0386.05045MR0463023
  10. RUIZ S., Problem, In: Combinatorics 79, part II. Ann. Discrete Math. 9. North-Holland, Amsterdam 1980, 308. (1980) MR0597383
  11. SCHWENK A. J., Removal-cospectral sets of vertices in a graph, In: Proceedings of the Tenth Southeastern Conference on Combinatorics, Graph Theory and Computing. Congressus Numerantium 24. Utilitas Math. Publ. Co., Winnipeg, Manitoba 1979, Voll. II, 849-860. (1979) Zbl0422.05035MR0561102
  12. ŠIRÁŇ J., On graphs containing many subgraphs with the same number of edges, Math. Slovaca 30, 1980, 267-268. (1980) Zbl0436.05056MR0587253
  13. YAP H. P., On graphs whose edge-deleted subgraphs have at most two orbits, Ars Combinatoria 10, 1980, 27-30. (1980) Zbl0457.05049MR0598896
  14. YAP H. P., On graphs whose maximal subgraphs have at most two orbits, Discrete Math., to appear. Zbl0472.05032MR0676432
  15. ZASLAVSKY T., Uniform distribution of a subgraph in a graph, In: Proc. Colloq. Internat. sur la Théorie des Garphes at la Combinatoire (Marseille-Luminy 1981), to appear. (1981) MR0841354

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.