Accès libre

The Subset-Strong Product of Graphs

  
10 janv. 2024
À propos de cet article

Citez
Télécharger la couverture

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.

Langue:
Anglais
Périodicité:
2 fois par an
Sujets de la revue:
Mathématiques, Mathématiques générales