Computing Szeged Index of Graphs on Triples

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.

DARAFSHEH M.R.; MODABERNIA R.; NAMDARI M.

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Iranian Journal of Mathematical Chemistry Year:2017 | Volume:8 | Issue:2 Page(s): 175-180

Download Full-Text

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

Persian Verion

View:

385

Download:

120

Cites:

Information Journal Paper

Title

Computing Szeged Index of Graphs on Triples

Author(s)

DARAFSHEH M.R. | MODABERNIA R. | NAMDARI M. | Issue Writer Certificate

Keywords

Szeged indexQ1

Intersection graphQ1

Automorphism of graphQ1

Abstract

Let G=(V, E) be a simple connected graph with vertex set V and edge set E. The Szeged index of G is defined by Sz(G)= ∑ _e=uv∊ E^n_u(e|G)n_v(e|G), where nu(e|G) is the number of vertices of G closer to u than v and nv(e|G) can be defined in a similar way. Let S be a set of sizen ≥ 8 and V be the set of all subsets of S of size 3. We define three types of Intersection graphs with vertex set V. These graphs are denoted by Gi(n), i=0, 1, 2 and we will find their Szeged indices.

Cites

No record.

References

No record.

Cite

APA: Copy

DARAFSHEH, M.R., MODABERNIA, R., & NAMDARI, M.. (2017). Computing Szeged Index of Graphs on Triples. IRANIAN JOURNAL OF MATHEMATICAL CHEMISTRY, 8(2 ), 175-180. SID. https://sid.ir/paper/205549/en

Vancouver: Copy

DARAFSHEH M.R., MODABERNIA R., NAMDARI M.. Computing Szeged Index of Graphs on Triples. IRANIAN JOURNAL OF MATHEMATICAL CHEMISTRY[Internet]. 2017;8(2 ):175-180. Available from: https://sid.ir/paper/205549/en

IEEE: Copy

M.R. DARAFSHEH, R. MODABERNIA, and M. NAMDARI, “Computing Szeged Index of Graphs on Triples,” IRANIAN JOURNAL OF MATHEMATICAL CHEMISTRY, vol. 8, no. 2 , pp. 175–180, 2017, [Online]. Available: https://sid.ir/paper/205549/en

Related Journal Papers