Zobrazeno 1 - 10
of 106
pro vyhledávání: '"Michael S. Jacobson"'
Publikováno v:
IROS
Evidence suggests that the metabolic cost associated with the locomotive activity of walking is dependent upon ankle stiffness. This stiffness can be a control parameter in an ankle-foot prosthesis. Considering unique physical interaction between eac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb1159f221c7aa445ea0111c5c1ed014
https://doi.org/10.1109/iros45743.2020.9341101
https://doi.org/10.1109/iros45743.2020.9341101
Publikováno v:
Journal of Graph Theory. 89:250-265
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9ce8c9efc9e6efa65b19f7555b808082
https://doi.org/10.1002/jgt.22249
https://doi.org/10.1002/jgt.22249
Publikováno v:
Journal of Graph Theory. 84:202-213
A dominating path in a graph is a path P such that every vertex outside P has a neighbor on P. A result of Broersma from 1988 implies that if G is an n-vertex k-connected graph and , then G contains a dominating path. We prove the following results.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::55e5aac770593253886c81275e7aa538
https://doi.org/10.1002/jgt.22021
https://doi.org/10.1002/jgt.22021
Autor:
Michael S. Jacobson
Publikováno v:
Non-Obstetric Surgery During Pregnancy ISBN: 9783319907512
The impact of pregnancy on ophthalmic issues and medical conditions is well documented. However, there is very little information in the literature about how pregnancy influences eye surgery. There is scant information on how it affects decision-maki
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::21d4a54c8fb5c76061612779acd4788b
https://doi.org/10.1007/978-3-319-90752-9_19
https://doi.org/10.1007/978-3-319-90752-9_19
Publikováno v:
Mathematics and Statistics Faculty Publications
Discussiones Mathematicae Graph Theory, Vol 39, Iss 1, Pp 157-170 (2019)
Discussiones Mathematicae Graph Theory, Vol 39, Iss 1, Pp 157-170 (2019)
A graph G is H-saturated if H is not a subgraph of G but the addition of any edge from the complement of G to G results in a copy of H. The minimum number of edges (the size) of an H-saturated graph on n vertices is denoted sat(n, H), while the maxim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ff74c8554a8f855cd9c5c804ae57af30
https://digitalcommons.usu.edu/mathsci_facpub/239
https://digitalcommons.usu.edu/mathsci_facpub/239
Publikováno v:
Journal of Graph Theory. 77:237-250
A broom is a tree obtained by subdividing one edge of the star an arbitrary number of times. In (E. Flandrin, T. Kaiser, R. Kužel, H. Li and Z. Ryjacek, Neighborhood Unions and Extremal Spanning Trees, Discrete Math 308 (2008), 2343–2350) Flandrin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a1a6de668469c184c84dc38b155a8fc
https://doi.org/10.1002/jgt.21784
https://doi.org/10.1002/jgt.21784
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 33, Iss 4, Pp 677-693 (2013)
For a fixed graph F, a graph G is F-saturated if there is no copy of F in G, but for any edge e ∉ G, there is a copy of F in G + e. The minimum number of edges in an F-saturated graph of order n will be denoted by sat(n, F). A graph G is weakly F-s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6aaca40992148e3a2eed5967e600e51b
https://doaj.org/article/05f0ce25cbae4072a13151ffafb8eafd
https://doaj.org/article/05f0ce25cbae4072a13151ffafb8eafd
Publikováno v:
Graphs and Combinatorics. 30:847-859
A (finite) sequence of nonnegative integers is graphic if it is the degree sequence of some simple graph G. Given graphs G 1 and G 2, we consider the smallest integer k such that for every k-term graphic sequence π, there is some graph G with degree
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fc9bf524070947f38d114902272ce66e
https://doi.org/10.1007/s00373-013-1307-y
https://doi.org/10.1007/s00373-013-1307-y
Publikováno v:
Journal of Graph Theory. 71:416-434
For a family of graphs, a graph G is -saturated if G contains no member of as a subgraph, but for any edge in , contains some member of as a subgraph. The minimum number of edges in an -saturated graph of order n is denoted *. A subdivision of a grap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a8e28271b5fe1daf0b9fac596df7c2a4
https://doi.org/10.1002/jgt.21625
https://doi.org/10.1002/jgt.21625
Publikováno v:
Combinatorics, Probability and Computing. 21:129-139
A graph is claw-free if it does not contain an induced subgraph isomorphic to K1,3. Cycles in claw-free graphs have been well studied. In this paper we extend results on disjoint cycles in claw-free graphs satisfying certain minimum degree conditions
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9ec0996b5fa5ea8c5c699bbca993b2e6
https://doi.org/10.1017/s0963548311000708
https://doi.org/10.1017/s0963548311000708