Thumbnail
Access Restriction
Open

Author Godsil, C. ♦ Mckay, B.
Source CiteSeerX
Content type Text
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Cospeetral Graph ♦ Non-cospectral Graph ♦ Infinite Family ♦ Nm-isomorphic Pair ♦ Spectral Radius ♦ Eon-nected Cospectral Graph ♦ Disjoint Subgraphs ♦ New Method
Description In this paper some new methods of constructing infinite families of cospeetral graphs are presented. As an esampIe of their application it is shorn that given any 2n- 2 graph G on n vertices one can construct at least ( n-2) nm-isomorphic pairs of eon-nected cospectral graphs on 3n vertices such that each member of each of the pairs contains three disjoint subgraphs isomorphic to G. The same procedure can be wed to construct pairs of non-isomorphic and non-cospectral graphs with the same spectral radius containing any two given graphs as disjoint induced subgraphs.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 1975-01-01
Publisher Institution PROCEEDINGS OF FOURTH AUSTRALIAN COMB. CONF