E-viri
Recenzirano
-
Li, Hengzhe; Ma, Yingbin; Yang, Weihua; Wang, Yifei
Applied mathematics and computation, 02/2017, Letnik: 295Journal Article
The generalized k-connectivity κk(G) of a graph G, which was introduced by Chartrand et al. (1984), is a generalization of the concept of vertex connectivity. For this generalization, the generalized 2-connectivity κ2(G) of a graph G is exactly the connectivity κ(G) of G. In this paper, let G be a connected graph of order n and let H be a 2-connected graph. For Cartesian product, we show that κ3(G□H)≥κ3(G)+1 if κ(G)=κ3(G); κ3(G□H)≥κ3(G)+2 if κ(G) > κ3(G). Moreover, above bounds are sharp. As an example, we show that κ3(Cn1□Cn2□⋯Cnk︷k)=2k−1, where Cni is a cycle. For lexicographic product, we prove that κ3(H∘G)≥max{3δ(G)+1,⌈3n+12⌉} if δ(G)<2n−13, and κ3(H∘G)=2n if δ(G)≥2n−13.
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Vnos na polico
Trajna povezava
- URL:
Faktor vpliva
Dostop do baze podatkov JCR je dovoljen samo uporabnikom iz Slovenije. Vaš trenutni IP-naslov ni na seznamu dovoljenih za dostop, zato je potrebna avtentikacija z ustreznim računom AAI.
Leto | Faktor vpliva | Izdaja | Kategorija | Razvrstitev | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Baze podatkov, v katerih je revija indeksirana
Ime baze podatkov | Področje | Leto |
---|
Povezave do osebnih bibliografij avtorjev | Povezave do podatkov o raziskovalcih v sistemu SICRIS |
---|
Vir: Osebne bibliografije
in: SICRIS
To gradivo vam je dostopno v celotnem besedilu. Če kljub temu želite naročiti gradivo, kliknite gumb Nadaljuj.