Zobrazeno 1 - 10
of 61
pro vyhledávání: '"Josef Lauri"'
Publikováno v:
Pharmacy Practice, Vol 19, Iss 1, p 2317 (2021)
Background: The pandemic is at a paradoxical stage, with vaccine roll out initiated but a significantly elevated level of infection and death. Hope for recovery lies in high equitable vaccine uptake. Objective: The study aimed to: i) explore attit
Externí odkaz:
https://doaj.org/article/ebec34969892459ebec288f9b1e33ba4
Publikováno v:
Theory and Applications of Graphs, Vol 4, Iss 1 (2017)
A perfect forest is a spanning forest of a connected graph $G$, all of whose components are induced subgraphs of $G$ and such that all vertices have odd degree in the forest. A perfect forest generalised a perfect matching since, in a matching, all c
Externí odkaz:
https://doaj.org/article/27b854d03c0848b6ac34f643f0a3dca7
Autor:
Josef Lauri, Raffaele Scapellato
This in-depth coverage of important areas of graph theory maintains a focus on symmetry properties of graphs. Standard topics on graph automorphisms are presented early on, while in later chapters more specialised topics are tackled, such as graphica
Publikováno v:
BJS Open. 6
Background: Natural orifice specimen extraction (NOSE) is a technique that involves collecting a specimen for extraction through a natural opening avoiding a mini-laparotomy incision. The aim of this study was to compare NOSE and transabdominal speci
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cdf34044cfe052858ba5277fd44d883c
https://doi.org/10.1093/bjsopen/zrac074
https://doi.org/10.1093/bjsopen/zrac074
Publikováno v:
Discrete Applied Mathematics. 266:85-91
Let G be a graph. It is known that Aut ( G ) × Z 2 is contained in Aut ( G × K 2 ) where G × K 2 is the direct product of G with K 2 . When this inclusion is strict, the graph G is called unstable. We define the index of instability of G as | Aut
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::45798282b5811bc8e822440c8cac0cc9
https://doi.org/10.1016/j.dam.2018.10.026
https://doi.org/10.1016/j.dam.2018.10.026
Autor:
Josef Lauri, Mary Anne Lauri
Publikováno v:
Early Human Development. 133:57-61
Images can be helpful for eliciting data in the form of responses from participants. Sometimes photographs can help participants speak about issues, events, thoughts and emotions which they find difficult to talk about. This paper discusses how photo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c76f475ab1779c9e094a68517a510f21
https://doi.org/10.1016/j.earlhumdev.2019.03.013
https://doi.org/10.1016/j.earlhumdev.2019.03.013
Publikováno v:
Early Human Development. 127:15-20
One popular stopping rule intended to increase the rate of male births is to keep having babies until the first male is born. We show that such a stopping rule does not change the sex ratio at birth when the probability p that a birth produces a male
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::580028dd65a3f8570edc7a00156a0bd7
https://doi.org/10.1016/j.earlhumdev.2018.09.005
https://doi.org/10.1016/j.earlhumdev.2018.09.005
Let $G$ be a prolific graph, that is a finite connected simple graph which is not isomorphic to a cycle nor a path nor the star graph $K_{1,3}$. The line-graph of $G$, denoted by $L(G)$, is defined by having its vertex-set equal to the edge-set of $G
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b3bb5f6f15e5fc77ed803e9f1930807b
http://arxiv.org/abs/2105.02496
http://arxiv.org/abs/2105.02496
We consider the following feasibility problem: given an integer $n \geq 1$ and an integer $m$ such that $0 \leq m \leq \binom{n}{2}$, does there exist a line graph $L = L(G)$ with exactly $n$ vertices and $m$ edges ? We say that a pair $(n,m)$ is non
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c5c3e7c5099f6ec68387679bbee99fa
Publikováno v:
Springer Proceedings in Mathematics & Statistics ISBN: 9783030328078
Two methods, structural (constructive) and multiplier (analytical), of exact enumeration of undirected and directed circulant graphs of orders 27 and 125 are elaborated and represented in detail here together with intermediate and final numerical dat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2d123b8801523ffdb2a43693f406bea4
https://doi.org/10.1007/978-3-030-32808-5_2
https://doi.org/10.1007/978-3-030-32808-5_2