Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Irandokht Rezaee"'
Publikováno v:
Mathematics Interdisciplinary Research, Vol 7, Iss 4, Pp 331-342 (2022)
Let G=(V, E) be a graph with vertex set V(G) and edge set E(G). The Sombor index of a graph G, SO(G), is defined as ∑uv∈ E(G) √(d2u+d2v), where du is the degree of vertex u in V(G). In the present paper,
Externí odkaz:
https://doaj.org/article/ca9fe411c2c1428ea064d45e7ed3de5d
Publikováno v:
Mathematics Interdisciplinary Research, Vol 3, Iss 1, Pp 55-65 (2018)
Let G and H be graphs. The strong product GH of graphs G and H is the graph with vertex set V(G)V(H) and u=(u1, v1) is adjacent with v= (u2, v2) whenever (v1 = v2 and u1 is adjacent with u2) or (u1 = u2 and v1 is adjacent with v2) or (u1 is adj
Externí odkaz:
https://doaj.org/article/7c085dd769ea45c4832d4c485cc2a0da
Publikováno v:
Mathematics Interdisciplinary Research, Vol 1, Iss 2, Pp 317-323 (2016)
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree se
Externí odkaz:
https://doaj.org/article/ba19685fc24f46ebbcf57ae67fce6271
Let $G$ be a simple graph with $m$ edges and $H_i$, $1\leq i \leq m$ be simple graphs too. The generalized edge corona product of graphs $G$ and $H_1, ..., H_m$, denoted by $G \diamond (H_1, ..., H_m)$, is obtained by taking one copy of graphs $G$, $
Externí odkaz:
http://arxiv.org/abs/1712.04699
