Constructing graphs with several pseudosimilar vertices or edges

Discrete Mathematics

Volumn 267, Issue 1-3 SPEC., 2003, Pages 197-211

  Lauri, Josef ^a  

^a UNIVERSITY OF MALTA   (Malta)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037507557     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00615-5     Document Type: Article

References (28)

1. B. Alspach, M.-Y. Xu, 1/2-arc-transitive graphs of order 3p, J. Algebraic Combin. 3 (1994) 347-355.
2. N.L. Biggs, Algebraic Graph Theory, 2nd Edition, Cambridge University Press, Cambridge, 1994.
3. I.Z. Bouwer, Section graphs for finite permutation groups, J. Combin. Theory 6 (1969) 378-386.
4. H. Cohn, Advanced Number Theory, Dover, New York, 1990.
5. J. Folman, Regular line-symmetric graphs, J. Combin. Theory 3 (1967) 215-232.
6. C.D. Godsil, On the full automorphism group of a graph, Combinatorica 1 (1981) 243-256.
7. C.D. Godsil, W.L. Kocay, Constructingg raphs with pairs of pseudo similar vertices, J. Combin. Theory Ser. B 35 (1982) 146-155.
8. C.D. Godsil, W.L. Kocay, Graphs with three mutually pseudosimilar vertices, J. Combin. Theory Ser. B 35 (1983) 240-246.
9. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.
10. W. Imrich, Graphical regular representations of groups of odd order, in: A. Hajnal, V.T. SXos (Eds.), Combinatorics, Colloquia Mathematica Societatis Janos Bolyai, Vol. 18, North-Holland, Amsterdam, 1978, pp. 611-622.
11. R.J. Kimble, Existence of graphs where almost every edge is pseudosimilar, in: G. Chartrand et al. (Eds.), Theory and Applications of Graphs, Proceedings of the Fourth International Conference, Theory and Applications of Graphs, Western Michigan University, Kalamazoo, Wiley, New York, 1981, pp. 431-436.
12. R.J. Kimble, A.J. Schwenk, P.K. Stockmeyer, Pseudosimilar vertices in a graph, J. Graph Theory 5 (1981) 171-181.
13. M.M. Klawe, D.G. Kirkpatrick, D.G. Corneil, On pseudosimilarity in trees, J. Combin. Theory Ser. B 34 (1983) 323-339.
14. W.L. Kocay, A small graph with three mutually pseudosimilar vertices, Ars Combin. 14 (1982) 99-103.
15. W.L. Kocay, Graphs, groups and pseudosimilar vertices, J. Austral. Math. Soc. Ser. A 37 (1984) 181-189.
16. W.L. Kocay, P. Niesink, C.R. Zarnke, On coset diagrams for pseudo-similar vertices, Utilitas Math. 46 (1994) 65-80.
17. V. Krishnamoorthy, K.R. Parthasarathy, Cospectral graphs and digraphs with given automorphism group, J. Combin. Theory Ser. B 19 (1975) 204-213.
18. J. Lauri, Endvertex-deleted subgraphs, Ars Combin. 36 (1993) 171-182.
19. J. Lauri, Pseudosimilarity in graphs-a survey, Ars Combin. 46 (1997) 77-95.
20. J. Lauri, Cayley graphs, pseudosimilar edges, and line-graphs, J. Combin. Math. Combin. Comput. 32 (2000) 149-159.
21. J. Lauri, M.C. Marino, On pseudosimilarity in graphs, in: A. Barlotti et al. (Eds.), Combinatorics 88, Proceedings of the International Conference on Incidence Geometries and Combinatorial Structures, Vol. 2, Ravello, Italy, 1988, 1991, pp. 169-179.
22. J. Lauri, R. Scapellato, A note on graphs all of whose edges are pseudosimilar, Graph Theory Notes New York XXI (1996) 11-13.
23. D. Livingstone, A. Wagner, Transitivity of finite permutation groups on unordered sets, Math. Z. 90 (1965) 393-403.
24. G. Sabidussi, Vertex transitive graphs, Monat. Math. 68 (1964) 426-438.
25. J. Sheehan, Minimum multiplicities of subgraphs, preprint.
26. J. Sheehan, Fixingsubg raphs, J. Combin. Theory 12 (1972) 226-224.
27. J. Sheehan, Fixingsubg raphs and Ulams conjecture, J. Combin. Theory 14 (1973) 125-131.
28. J. Sheehan, Smoothly embeddable subgraphs, J. London Math. Soc. 9(2) (1974) 212-218.