مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

video

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

sound

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Version

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

View:

377
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download:

138
مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Cites:

Information Journal Paper

Title

GRAPHS COSPECTRAL WITH A FRIENDSHIP GRAPH OR ITS COMPLEMENT

Pages

  37-52

Abstract

 Let n be any positive integer and Fn be the friendship (or Dutch windmill) graph with 2n+1 vertices and 3n edges. Here we study graphs with the same adjacency spectrum as Fn. Two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. Let G be a graph cospectral with Fn. Here we prove that if G has no cycle of length 4 or 5, then G @ Fn. Moreover if G is connected and planar then G @ Fn. All but one of connected components of G are isomorphic to K2.The complement `Fn of the friendship graph is determined by its ADJACENCY EIGENVALUES, that is, if `Fn is cospectral with a graph H, then H @`Fn.

Cites

  • No record.

    • References

  • No record.

    • Cite

    APA: Copy

    ABDOLLAHI, ALIREZA, JANBAZ, SHAHROOZ, & OBOUDI, MOHAMMAD REZA. (2013). GRAPHS COSPECTRAL WITH A FRIENDSHIP GRAPH OR ITS COMPLEMENT. TRANSACTIONS ON COMBINATORICS, 2(4), 37-52. SID. https://sid.ir/paper/669244/en

    Vancouver: Copy

    ABDOLLAHI ALIREZA, JANBAZ SHAHROOZ, OBOUDI MOHAMMAD REZA. GRAPHS COSPECTRAL WITH A FRIENDSHIP GRAPH OR ITS COMPLEMENT. TRANSACTIONS ON COMBINATORICS[Internet]. 2013;2(4):37-52. Available from: https://sid.ir/paper/669244/en

    IEEE: Copy

    ALIREZA ABDOLLAHI, SHAHROOZ JANBAZ, and MOHAMMAD REZA OBOUDI, “GRAPHS COSPECTRAL WITH A FRIENDSHIP GRAPH OR ITS COMPLEMENT,” TRANSACTIONS ON COMBINATORICS, vol. 2, no. 4, pp. 37–52, 2013, [Online]. Available: https://sid.ir/paper/669244/en

    Related Journal Papers

  • No record.

    • Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops






    Move to top
    telegram sharing button
    whatsapp sharing button
    linkedin sharing button
    twitter sharing button
    email sharing button
    email sharing button
    email sharing button
    sharethis sharing button