SOME GRAPHS WITH VERTEX-COLORING 2-EDGE WEIGHTING

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.

Davoodi Akbar; OMOOMI BEHNAZ

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

Seminar Paper

Paper Information

Seminar: ANNUAL IRANIAN MATHEMATICS CONFERENCE
Year:2013 | Issue:44

Download Full-Text

View:

157

Download:

Information Seminar Paper

Title

SOME GRAPHS WITH VERTEX-COLORING 2-EDGE WEIGHTING

Author(s)

Davoodi Akbar | OMOOMI BEHNAZ | Issue Writer Certificate

Keywords

DISTINGUISHING COLORING

VERTEX-COLORING EDGE-WEIGHTING

1-2-3-CONJECTURE

Abstract

A K -EDGE-WEIGHTING OF A GRAPH G IS A FUNCTION (FORMULA). AN EDGE-WEIGHTING NATURALLY INDUCES A VERTEX COLORING C, WHERE FOR EVERY (FORMULA).IF THE INDUCED COLORING C IS A PROPER VERTEX COLORING, THEN W IS CALLED A VERTEX-COLORING K -EDGE WEIGHTING (VC K -EW). KARONSKI ET AL. IN 2004, CONJECTURED THAT EVERY GRAPH ADMITS A VC3-EW. THIS CONJECTURE IS KNOWN AS 1-2-3-CONJECTURE. IN THIS TALK, FIRST, WE GIVE SOME SUFFICIENT CONDITIONS FOR A GRAPH TO ADMIT A VC2-EW. THEN WE STUDY THE VERTEX-COLORING EDGE-WEIGHTING OF CARTESIAN PRODUCT OF GRAPHS.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Davoodi, Akbar, & OMOOMI, BEHNAZ. (2013). SOME GRAPHS WITH VERTEX-COLORING 2-EDGE WEIGHTING. ANNUAL IRANIAN MATHEMATICS CONFERENCE. SID. https://sid.ir/paper/924859/en

Vancouver: Copy

Davoodi Akbar, OMOOMI BEHNAZ. SOME GRAPHS WITH VERTEX-COLORING 2-EDGE WEIGHTING. 2013. Available from: https://sid.ir/paper/924859/en

IEEE: Copy

Akbar Davoodi, and BEHNAZ OMOOMI, “SOME GRAPHS WITH VERTEX-COLORING 2-EDGE WEIGHTING,” presented at the ANNUAL IRANIAN MATHEMATICS CONFERENCE. 2013, [Online]. Available: https://sid.ir/paper/924859/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops