52 resultados para CONNECTIVITY OPERATORS
Resumo:
Let G1 = (V1, E1) and G2 = (V2, E2) be two graphs having a distinguished or root vertex, labeled 0. The hierarchical product G2 ⊓ G1 of G2 and G1 is a graph with vertex set V2 × V1. Two vertices y2y1 and x2x1 are adjacent if and only if y1x1 ∈ E1 and y2 = x2; or y2x2 ∈ E2 and y1 = x1 = 0. In this paper, the Wiener, eccentric connectivity and Zagreb indices of this new operation of graphs are computed. As an application, these topological indices for a class of alkanes are computed. ACM Computing Classification System (1998): G.2.2, G.2.3.
Resumo:
2010 Mathematics Subject Classification: Primary 35S05, 35J60; Secondary 35A20, 35B08, 35B40.
Resumo:
2010 Mathematics Subject Classification: Primary 35S05; Secondary 35A17.
Resumo:
2010 Mathematics Subject Classification: 42B10, 47A07, 35S05.
Resumo:
2010 Mathematics Subject Classification: 35Q15, 31A25, 37K10, 35Q58.
Resumo:
2002 Mathematics Subject Classification: 35S05, 47G30, 58J42.
Resumo:
2002 Mathematics Subject Classification: 35L15, 35L80, 35S05, 35S30
Resumo:
2000 Mathematics Subject Classification: 46B28, 47D15.
Resumo:
AMS Subject Classification 2010: 41A25, 41A35, 41A40, 41A63, 41A65, 42A38, 42A85, 42B10, 42B20
Resumo:
MSC 2010: 54C35, 54C60.
Resumo:
2000 Mathematics Subject Classification: Primary 47A48, 93B28, 47A65; Secondary 34C94.
Resumo:
2000 Mathematics Subject Classification: 35S05.
Resumo:
2000 Mathematics Subject Classification: 35L15, Secondary 35L30.