Published: 2024-01-10

The subset-strong product of graphs

Mehdi Eliasi Logo ORCID

Abstract

In this paper, we introduce the subset-strong product of graphs and give a method for calculating the adjacency spectrum of this product. In addition, exact expressions for the first and second Zagreb indices of the subset-strong products of two graphs are reported. Examples are provided to illustrate the applications of this product in some growing graphs and complex networks.

Download files

Citation rules

Eliasi, M. (2024). The subset-strong product of graphs. Annales Mathematicae Silesianae, 38(2), 263–283. Retrieved from https://journals.us.edu.pl/index.php/AMSIL/article/view/16730

Vol. 38 No. 2 (2024)
Published: 2024-07-23


ISSN: 0860-2107
eISSN: 2391-4238
Ikona DOI 10.1515/amsil

Publisher
University of Silesia Press

This website uses cookies for proper operation, in order to use the portal fully you must accept cookies.