video

sound

Persian Version

View:

310

Download:

0

Cites:

Information Journal Paper

Title

Multipartite Integral Circulant Graphs

Pages

  167-170

Abstract

 In this paper we specify the class of integral Circulant Graphs ICG(n; D), which can be characterized by their order n and the set D of positive divisors of n in such a way that they have the vertex set Zn and the edge set (Formola). This group of graphs is called BMM graphs because of the form of its set of edges. A bipartite G graph is a graph whose vertex set can be divided into two subsets X, and Y such that no two vertices in X and no two vertices in Y are adjacent. The duplicate graph is called complete if each vertex in X is connected to all vertices in Y. This graph is represented by K_ (m, n), if | X | = m and | Y | = n. Multipartite Graphs are also defined as bipartite graphs.

Cites

  • No record.

    • References

  • No record.

    • Cite

    APA: Copy

    SAFAKISH HAMEDANI, G.R., & ABASI, J.. (2020). Multipartite Integral Circulant Graphs. JOURNAL OF ELECTRONIC AND CYBER DEFENCE, 8(3 (31) ), 167-170. SID. https://sid.ir/paper/389509/en

    Vancouver: Copy

    SAFAKISH HAMEDANI G.R., ABASI J.. Multipartite Integral Circulant Graphs. JOURNAL OF ELECTRONIC AND CYBER DEFENCE[Internet]. 2020;8(3 (31) ):167-170. Available from: https://sid.ir/paper/389509/en

    IEEE: Copy

    G.R. SAFAKISH HAMEDANI, and J. ABASI, “Multipartite Integral Circulant Graphs,” JOURNAL OF ELECTRONIC AND CYBER DEFENCE, vol. 8, no. 3 (31) , pp. 167–170, 2020, [Online]. Available: https://sid.ir/paper/389509/en

    Related Journal Papers

  • No record.

    • Related Seminar Papers

  • No record.

    • Related Plans

  • No record.

    • Recommended Workshops