Geodesic
Induced subgraphs with the same order and size
Mathematica slovaca, Tome 33 (1983) no. 1, pp. 105-119
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C35, 05C75, 05C99 
@article{MASLO_1983_33_1_a16,
     author = {Bos\'ak, Juraj},
     title = {Induced subgraphs with the same order and size},
     journal = {Mathematica slovaca},
     pages = {105--119},
     year = {1983},
     volume = {33},
     number = {1},
     mrnumber = {689286},
     zbl = {0511.05051},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1983_33_1_a16/}
}
TY  - JOUR
AU  - Bosák, Juraj
TI  - Induced subgraphs with the same order and size
JO  - Mathematica slovaca
PY  - 1983
SP  - 105
EP  - 119
VL  - 33
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/MASLO_1983_33_1_a16/
LA  - en
ID  - MASLO_1983_33_1_a16
ER  - 
%0 Journal Article
%A Bosák, Juraj
%T Induced subgraphs with the same order and size
%J Mathematica slovaca
%D 1983
%P 105-119
%V 33
%N 1
%U http://geodesic.mathdoc.fr/item/MASLO_1983_33_1_a16/
%G en
%F MASLO_1983_33_1_a16
Bosák, Juraj. Induced subgraphs with the same order and size. Mathematica slovaca, Tome 33 (1983) no. 1, pp. 105-119. http://geodesic.mathdoc.fr/item/MASLO_1983_33_1_a16/

[1] AKIYAMA J., EXOO G., HARARY F.: The graphs with all induced subgraphs isomorphic. Bull Malaysian Math. Soc. (2) 2, 1979, 43-44. | MR | Zbl

[2] BOSÁK J.: Induced subgraphs. In: Proceedings of the Sixth Hungarium Colloquium on Combinatorics (Eger 1981), sumbitted.

[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. | MR | Zbl

[4] HARARY F., PALMER E.: on similar points of a graph. J. Math. Mech. 15, 1966, 623-630. | MR | Zbl

[5] KIMBLE R. J., SCHWENK A. J., STOCKMEYER P. K.: Pseudosimilar vertices in a graph. J. Graph Theory 5, 1981, 171-181. | MR

[6] KOCAY W. L.: On pseudo-similar vertices. Ars Combinatoria 10, 1980, 147-163. | MR | Zbl

[7] KRISHNAMOORTHY V., PARTHASARATHY K. R.: Cospectral graphs and digraphs with given automorphism group. J. Combinatorial Theory B 19, 1975, 204-213. | MR | Zbl

[8] MANVEL B., REYNER S. W.: Subgraph-equivalence of graphs. J. Combinatorics Information Syst. Sci. 1, 1976, 41-47. | MR | Zbl

[9] McKAY B. D.: Computer reconstruction of small graphs. J. Graph Theory 1, 1977, 281-283. | MR | Zbl

[10] RUIZ S.: Problem. In: Combinatorics 79, part II. Ann. Discrete Math. 9. North-Holland, Amsterdam 1980, 308. | MR

[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. | MR | Zbl

[12] ŠIRÁŇ J.: On graphs containing many subgraphs with the same number of edges. Math. Slovaca 30, 1980, 267-268. | MR | Zbl

[13] YAP H. P.: On graphs whose edge-deleted subgraphs have at most two orbits. Ars Combinatoria 10, 1980, 27-30. | MR | Zbl

[14] YAP H. P.: On graphs whose maximal subgraphs have at most two orbits. Discrete Math., to appear. | MR | Zbl

[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. | MR