ADJACENT VERTEX DISTINGUISHING ACYCLIC EDGE COLORING OF THE CARTESIAN PRODUCT OF GRAPHS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

MOUSAVI FATEMEH SADAT; NOORI MASSOMEH

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

Journal Paper

Paper Information

Journal: TRANSACTIONS ON COMBINATORICS Year:2017 | Volume:6 | Issue:2 Page(s): 19-30

Download Full-Text

View:

252

Download:

122

Cites:

Information Journal Paper

Title

ADJACENT VERTEX DISTINGUISHING ACYCLIC EDGE COLORING OF THE CARTESIAN PRODUCT OF GRAPHS

Author(s)

MOUSAVI FATEMEH SADAT | NOORI MASSOMEH | Issue Writer Certificate

Keywords

ACYCLIC EDGE COLORING

ADJACENT VERTEX DISTINGUISHING ACYCLIC EDGE COLORING

ADJACENT VERTEX DISTINGUISHING ACYCLIC EDGE CHROMATIC NUMBER

Abstract

Let G be a graph and c′ aa(G) denotes the minimum number of colors required for an ACYCLIC EDGE COLORING of G in which no two adjacent vertices are incident to edges colored with the same set of colors. We prove a general bound for c′ aa (G □ H) for any two graphs G and H. We also determine exact value of this parameter for the Cartesian product of two paths, Cartesian product of a path and a cycle, Cartesian product of two trees, hypercubes. We show that c′ aa (Cm □ Cn) is at most 6 fo every m ≥ 3 and n≥3. Moreover in some cases we find the exact value of c′ aa (Cm □ Cn).

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

MOUSAVI, FATEMEH SADAT, & NOORI, MASSOMEH. (2017). ADJACENT VERTEX DISTINGUISHING ACYCLIC EDGE COLORING OF THE CARTESIAN PRODUCT OF GRAPHS. TRANSACTIONS ON COMBINATORICS, 6(2), 19-30. SID. https://sid.ir/paper/712128/en

Vancouver: Copy

MOUSAVI FATEMEH SADAT, NOORI MASSOMEH. ADJACENT VERTEX DISTINGUISHING ACYCLIC EDGE COLORING OF THE CARTESIAN PRODUCT OF GRAPHS. TRANSACTIONS ON COMBINATORICS[Internet]. 2017;6(2):19-30. Available from: https://sid.ir/paper/712128/en

IEEE: Copy

FATEMEH SADAT MOUSAVI, and MASSOMEH NOORI, “ADJACENT VERTEX DISTINGUISHING ACYCLIC EDGE COLORING OF THE CARTESIAN PRODUCT OF GRAPHS,” TRANSACTIONS ON COMBINATORICS, vol. 6, no. 2, pp. 19–30, 2017, [Online]. Available: https://sid.ir/paper/712128/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops