On graphs determining links with maximal number of components via medial construction

Autor: Fengming Dong, Eng Guan Tay, Xian'an Jin

Publikováno v: Discrete Applied Mathematics. 157:3099-3110

Let G be a connected plane graph, D(G) be the corresponding link diagram via medial construction, and μ(D(G)) be the number of components of the link diagram D(G). In this paper, we first provide an elementary proof that μ(D(G))≤n(G)+1, where n(G

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::11d2bfcaec6fe672a60ec2af811578ee
https://doi.org/10.1016/j.dam.2009.06.006

REPRESENTATIONS EXTREMALS

Autor: Núñez Lay, Tomás Alberto, Villavicencio Fernández, Helmuth

Publikováno v: Pesquimat, Vol 15, Iss 1 (2014)
Pesquimat; Vol. 15 No. 1 (2012)
Pesquimat; Vol. 15 Núm. 1 (2012)
Revistas Universidad Nacional Mayor de San Marcos
Universidad Nacional Mayor de San Marcos
instacron:UNMSM

In this work, we show the relation about a convex set with their extremes elements. We extended the Kein-Milman theorem in finite dimension for arbitrary convex set. En el presente trabajo se muestra la relación de un conjunto convexo con sus elemen

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f16bf84eedfc5c889a03f28c71afc60e
http://revistasinvestigacion.unmsm.edu.pe/index.php/matema/article/view/9607

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.