On the Saturation Number 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.

ALIKHANI S.; SOLTANI N.

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

Journal Paper

Paper Information

Journal: Iranian Journal of Mathematical Chemistry Year:2018 | Volume:9 | Issue:4 Page(s): 289-299

Download Full-Text

Persian Verion

View:

690

Download:

161

Cites:

Information Journal Paper

Title

On the Saturation Number of Graphs

Author(s)

ALIKHANI S. | SOLTANI N. | Issue Writer Certificate

Keywords

Maximal matchingQ1

Saturation numberQ1

CoronaQ1

Abstract

Let 􀜩 = (􀜸 , 􀜧 ) be a simple connected graph. A matching 􀜯 in a graph 􀜩 is a collection of edges of 􀜩 such that no two edges from 􀜯 share a vertex. A matching 􀜯 is maximal if it cannot be extended to a larger matching in 􀜩 . The cardinality of any smallest Maximal matching in 􀜩 is the Saturation number of 􀜩 and is denoted by 􀝏 (􀜩 ). In this paper we study the Saturation number of the Corona product of two specific graphs. We also consider some graphs with certain constructions that are of importance in chemistry and study their Saturation number.

Cites

No record.

References

No record.

Cite

APA: Copy

ALIKHANI, S., & SOLTANI, N.. (2018). On the Saturation Number of Graphs. IRANIAN JOURNAL OF MATHEMATICAL CHEMISTRY, 9(4 ), 289-299. SID. https://sid.ir/paper/205539/en

Vancouver: Copy

ALIKHANI S., SOLTANI N.. On the Saturation Number of Graphs. IRANIAN JOURNAL OF MATHEMATICAL CHEMISTRY[Internet]. 2018;9(4 ):289-299. Available from: https://sid.ir/paper/205539/en

IEEE: Copy

S. ALIKHANI, and N. SOLTANI, “On the Saturation Number of Graphs,” IRANIAN JOURNAL OF MATHEMATICAL CHEMISTRY, vol. 9, no. 4 , pp. 289–299, 2018, [Online]. Available: https://sid.ir/paper/205539/en

Related Journal Papers