Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 3

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

Harary Index of Product Graphs

100%
EN
The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. In this paper, the exact formulae for the Harary indices of tensor product G × Km0,m1,...,mr−1 and the strong product G⊠Km0,m1,...,mr−1 , where Km0,m1,...,mr−1 is the complete multipartite graph with partite sets of sizes m0,m1, . . . ,mr−1 are obtained. Also upper bounds for the Harary indices of tensor and strong products of graphs are estabilished. Finally, the exact formula for the Harary index of the wreath product G ○ G′ is obtained.
2
100%
EN
The Wiener index of a connected graph G, denoted by W(G), is defined as $½ ∑_{u,v ∈ V(G)}d_G(u,v)$. Similarly, the hyper-Wiener index of a connected graph G, denoted by WW(G), is defined as $½W(G) + ¼ ∑_{u,v ∈ V(G)} d²_G(u,v)$. The vertex Padmakar-Ivan (vertex PI) index of a graph G is the sum over all edges uv of G of the number of vertices which are not equidistant from u and v. In this paper, the exact formulae for Wiener, hyper-Wiener and vertex PI indices of the strong product $G ⊠ K_{m₀,m₁,...,m_{r -1}}$, where $K_{m₀,m₁,...,m_{r -1}}$ is the complete multipartite graph with partite sets of sizes $m₀,m₁, ...,m_{r -1}$, are obtained. Also lower bounds for Wiener and hyper-Wiener indices of strong product of graphs are established.
3
100%
EN
The Wiener index, denoted by W(G), of a connected graph G is the sum of all pairwise distances of vertices of the graph, that is, $W(G) = ½Σ_{u,v ∈ V(G)} d(u,v)$. In this paper, we obtain the Wiener index of the tensor product of a path and a cycle.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.