A NEW CONSTRUCTION FOR VERTEX DECOMPOSABLE 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.

HAJISHARI NASSER; TEHRANIAN ABOLFAZL

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

Journal Paper

Paper Information

Journal: TRANSACTIONS ON COMBINATORICS Year:2016 | Volume:5 | Issue:3 Page(s): 33-38

Download Full-Text

View:

301

Download:

Cites:

Information Journal Paper

Title

A NEW CONSTRUCTION FOR VERTEX DECOMPOSABLE GRAPHS

Author(s)

HAJISHARI NASSER | TEHRANIAN ABOLFAZL | Issue Writer Certificate

Keywords

VERTEX DECOMPOSABLE

SHELLABEL

COHEN-MACAULAY

Abstract

Let G be a finite simple graph on the vertex set V (G) and let S Í V (G). Adding a whisker to G at x means adding a new vertex y and edge xy to G where x Î V (G). The graph G È W (S) is obtained from G by adding a whisker to every vertex of S. We prove that if G \ S is either a graph with no chordless cycle of length other than 3 or 5, chordal graph or C5, then G È W (S) is a vertex decomposable graph.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

HAJISHARI, NASSER, & TEHRANIAN, ABOLFAZL. (2016). A NEW CONSTRUCTION FOR VERTEX DECOMPOSABLE GRAPHS. TRANSACTIONS ON COMBINATORICS, 5(3), 33-38. SID. https://sid.ir/paper/689852/en

Vancouver: Copy

HAJISHARI NASSER, TEHRANIAN ABOLFAZL. A NEW CONSTRUCTION FOR VERTEX DECOMPOSABLE GRAPHS. TRANSACTIONS ON COMBINATORICS[Internet]. 2016;5(3):33-38. Available from: https://sid.ir/paper/689852/en

IEEE: Copy

NASSER HAJISHARI, and ABOLFAZL TEHRANIAN, “A NEW CONSTRUCTION FOR VERTEX DECOMPOSABLE GRAPHS,” TRANSACTIONS ON COMBINATORICS, vol. 5, no. 3, pp. 33–38, 2016, [Online]. Available: https://sid.ir/paper/689852/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops