On Sombor coindex 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.

Phanjoubam Chinglensana; Mawiong Sainkupar M.n.; Buhphang Ardeline M.

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

Journal Paper

Paper Information

Journal: COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION Year:2023 | Volume:8 | Issue:3 Page(s): 513-529

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

On Sombor coindex of graphs

Author(s)

Phanjoubam Chinglensana | Mawiong Sainkupar M.n. | Buhphang Ardeline M. | Issue Writer Certificate

Keywords

Sombor index

Sombor coindex

total Sombor index

graph operations

Abstract

In this paper, we explore several properties of Sombor coindex of a finite simple graph and we derive a bound for the total Sombor index. We also explore its relations to the Sombor index, the Zagreb coindices, forgotten coindex and other important graph parameters. We further compute the bounds of the Somber coindex of some graph operations and derived explicit formulae of Sombor coindex for some well-known graphs as application.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Phanjoubam, Chinglensana, Mawiong, Sainkupar M.n., & Buhphang, Ardeline M.. (2023). On Sombor coindex of graphs. COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 8(3), 513-529. SID. https://sid.ir/paper/1057873/en

Vancouver: Copy

Phanjoubam Chinglensana, Mawiong Sainkupar M.n., Buhphang Ardeline M.. On Sombor coindex of graphs. COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION[Internet]. 2023;8(3):513-529. Available from: https://sid.ir/paper/1057873/en

IEEE: Copy

Chinglensana Phanjoubam, Sainkupar M.n. Mawiong, and Ardeline M. Buhphang, “On Sombor coindex of graphs,” COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, vol. 8, no. 3, pp. 513–529, 2023, [Online]. Available: https://sid.ir/paper/1057873/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops