E-viri
Recenzirano
Odprti dostop
-
Feng, Min; Ma, Xuanlong; Xu, Huiling
Graphs and combinatorics, 04/2022, Letnik: 38, Številka: 2Journal Article
Given a connected graph G = ( V ( G ) , E ( G ) ) , the length of a shortest path from a vertex u to a vertex v is denoted by d ( u , v ). For a proper subset W of V ( G ), let m ( W ) be the maximum value of d ( u , v ) as u ranging over W and v ranging over V ( G ) \ W . The proper subset W = { w 1 , … , w | W | } is a completeness-resolving set of G if Ψ W : V ( G ) \ W ⟶ m ( W ) | W | , u ⟼ ( d ( w 1 , u ) , … , d ( w | W | , u ) ) is a bijection, where m ( W ) | W | = { ( a ( 1 ) , … , a ( | W | ) ) ∣ 1 ≤ a ( i ) ≤ m ( W ) for each i = 1 , … , | W | } . A graph is completeness-resolvable if it admits a completeness-resolving set. In this paper, we first construct the set of all completeness-resolvable graphs by using the edge coverings of some vertices in given bipartite graphs, and then establish posets on some subsets of this set by the spanning subgraph relationship. Based on each poset, we find the maximum graph and give the lower and upper bounds for the number of edges in a minimal graph. Furthermore, minimal graphs satisfying the lower or upper bound are characterized.
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.