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

Persian Verion

مرکز اطلاعات علمی 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:

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

Download:

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

Cites:

Information Journal Paper

Title

ON THE NUMBER OF CLIQUES AND CYCLES IN GRAPHS

Pages

  27-33

Keywords

Abstract

 We give a new recursive method to compute the number of CLIQUEs and CYCLEs of a GRAPH. This method is related, respectively to the number of disjoint CLIQUEs in the complement GRAPH and to the sum of permanent function over all principal minors of the adjacency matrix of the GRAPH. In particular, let G be a GRAPH and let `G be its complement, then given the chromatic polynomial of `G, we give a recursive method to compute the number of CLIQUEs of G. Also given the adjacency matrix A of G we give a recursive method to compute the number of CYCLEs by computing the sum of permanent function of the principal minors of A. In both cases we confront to a new computable parameter which is defined as the number of disjoint CLIQUEs in G.

Cites

  • No record.
  • References

  • No record.
  • Cite

    APA: Copy

    ARIANNEJAD, MASOUD, & EMAMI, MOJGAN. (2013). ON THE NUMBER OF CLIQUES AND CYCLES IN GRAPHS. TRANSACTIONS ON COMBINATORICS, 2(2), 27-33. SID. https://sid.ir/paper/213750/en

    Vancouver: Copy

    ARIANNEJAD MASOUD, EMAMI MOJGAN. ON THE NUMBER OF CLIQUES AND CYCLES IN GRAPHS. TRANSACTIONS ON COMBINATORICS[Internet]. 2013;2(2):27-33. Available from: https://sid.ir/paper/213750/en

    IEEE: Copy

    MASOUD ARIANNEJAD, and MOJGAN EMAMI, “ON THE NUMBER OF CLIQUES AND CYCLES IN GRAPHS,” TRANSACTIONS ON COMBINATORICS, vol. 2, no. 2, pp. 27–33, 2013, [Online]. Available: https://sid.ir/paper/213750/en

    Related Journal Papers

    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