Affiliation:
1. 1 Department of Mathematics , Khansar Campus, University of Isfahan , Iran
Abstract
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.
Reference31 articles.
1. W.N. Anderson and T.D. Morley, Eigenvalues of the Laplacian of a graph, Linear and Multilinear Algebra 18 (1985), no. 2, 141–145.
2. D. Archambault, T. Munzner, and D. Auber, TopoLayout: Multilevel graph layout by topological features, IEEE Trans. Vis. Comput. Graph. 13 (2007), no. 2, 305–317.
3. D. Archambault, T. Munzner, and D. Auber, GrouseFlocks: Steerable exploration of graph hierarchy space, IEEE Trans. Vis. Comput. Graph. 14 (2008), no. 4, 900–913.
4. M. Arezoomand and B. Taeri, Zagreb indices of the generalized hierarchical product of graphs, MATCH Commun. Math. Comput. Chem. 69 (2013), no. 1, 131–140.
5. L. Barrière, C. Dalfó, M.A. Fiol, and M. Mitjana, The generalized hierarchical product of graphs, Discrete Math. 309 (2009), no. 12, 3871–3881.