Zobrazeno 1 - 10
of 268
pro vyhledávání: '"D. Ringeisen"'
Publikováno v:
The Cryosphere, Vol 17, Pp 4047-4061 (2023)
Despite its relevance for the Arctic climate and ecosystem, modeling sea-ice deformation, i.e., the opening, shearing, and ridging of sea ice, along linear kinematic features (LKFs) remains challenging, as the mechanical properties of sea ice are not
Externí odkaz:
https://doaj.org/article/5ec8d8baf6e24a65b3a032cdd4c2fe70
Publikováno v:
The Cryosphere, Vol 15, Pp 2873-2888 (2021)
The standard viscous–plastic (VP) sea ice model with an elliptical yield curve and a normal flow rule has at least two issues. First, it does not simulate fracture angles below 30∘ in uni-axial compression, in contrast with observations of linear
Externí odkaz:
https://doaj.org/article/01363a9d2acf431b8e1c9ead619c8f68
Publikováno v:
The Cryosphere, Vol 13, Pp 1167-1186 (2019)
Recent high-resolution pan-Arctic sea ice simulations show fracture patterns (linear kinematic features or LKFs) that are typical of granular materials but with wider fracture angles than those observed in high-resolution satellite images. Motivated
Externí odkaz:
https://doaj.org/article/db744a74395e4c13a6de363816c70afa
Publikováno v:
Discrete Applied Mathematics. (1):127-128
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=core_ac_uk__::87c6cbe409a3a20ead37070388762415
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Alhajjar, Mhaid Mhdi1 mhaid.alhajjar1991@gmail.com, Panda, Amaresh Chandra2 amaresh.panda@cgu-odisha.ac.in, Behera, Siva Prasad3 sivaprasad@cgu-odisha.ac.in
Publikováno v:
IAENG International Journal of Applied Mathematics. Oct2024, Vol. 54 Issue 10, p2143-2147. 5p.
Publikováno v:
Journal of Graph Theory. 20:71-76
In this paper we give a construction that produces exactly those graphs having maximum rectilinear crossing number equal to the subthrackle bound. We then prove a theorem characterizing these graphs in terms of proper circular-arc graphs. © 1996 Joh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ee9250739798059f53d2a1096805059
https://doi.org/10.1002/jgt.3190200107
https://doi.org/10.1002/jgt.3190200107
Autor:
Virginia Rice, Richard D. Ringeisen
Publikováno v:
Discrete Mathematics. 126(1-3):257-272
The cohesion of a graph was introduced to model vulnerability of a graph relative to the neighborhoods of its vertices. We are concerned in this paper with the changes in this parameter when an edge is deleted. In particular, after displaying some re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f0feb9d07db272d4bb0ca1b5f3fed5bb
Publikováno v:
Discrete Mathematics. 127(1-3):265-276
According to Conway as quoted in a paper by Woodall a graph is `thrackled? if it can be drawn with every edge crossing every other `eligible? one. The thrackle conjecture, which remains unsolved, states that any such graph with n vertices can have at
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::929a43aa0f4bb196253f3b9559fbba1a