E-viri
Recenzirano
-
Che, Zhongyuan
Discrete Applied Mathematics, 09/2020, Letnik: 284Journal Article
Let G be a plane elementary bipartite graph with more than two vertices. Then its resonance graph Z(G) is a median graph and the set M(G) of all perfect matchings of G with a specific partial order is a finite distributive lattice. In this paper, we prove that Z(G) is cube-free if and only if it can be obtained from an edge by a sequence of convex path expansions with respect to a reducible face decomposition of G. As a corollary, a structure characterization is provided for G whose Z(G) is cube-free. Furthermore, Z(G) is cube-free if and only if the Clar number of G is at most two, and sharp lower bounds on the number of perfect matchings of G can be expressed by the number of finite faces of G and the number of Clar formulas of G. It is known that a cube-free median graph is not necessarily planar. Using the lattice structure on M(G), we show that Z(G) is cube-free if and only if Z(G) is planar if and only if M(G) is an irreducible sublattice of m×n. We raise a question on how to characterize irreducible sublattices of m×n that are M(G).
Avtor
![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.