Results 51 to 60 of about 3,567 (160)
Indoor Air, Volume 2024, Issue 1, 2024.Nowadays, dust exposure pollution is receiving a lot of attention due to its significant impact on public health. To investigate the impact of dust particle size and human respiratory strength on respiratory particle deposition patterns, data was collected through on‐site surveys. The study analyzed the equivalent respiratory strength, dust environment
Gang Zhou +8 more
wiley +1 more source
Spanning Eulerian subgraphs and Catlin’s reduced graphs [PDF]
, 2016 A graph G is collapsible if for every even subset R ⊆ V (G), there is a spanning connected subgraph HR of G whose set of odd degree vertices is R. A graph is reduced if it has no nontrivial collapsible subgraphs.
Chen, Wei-Guo, Chen, Zhi-Hong
core +1 more source
Decomposing 8-regular graphs into paths of length 4
, 2016 A $T$-decomposition of a graph $G$ is a set of edge-disjoint copies of $T$ in $G$ that cover the edge set of $G$. Graham and H\"aggkvist (1989) conjectured that any $2\ell$-regular graph $G$ admits a $T$-decomposition if $T$ is a tree with $\ell$ edges ...
Botler, Fábio, Talon, Alexandre
core +1 more source
, 1996 The concept of a line digraph is generalized to that of a directed path graph. The directed path graph $\overrightarrow P_k(D)$ of a digraph D is obtained by representing the directed paths on k vertices of D by vertices.
Broersma, Hajo, Li, Xueliang
core +1 more source
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
, 2006 In multi-criteria optimization problems, several objective functions have to be optimized. Since the different objective functions are usually in conflict with each other, one cannot consider only one particular solution as the optimal solution. Instead,
Manthey, Bodo, Ram, L. Shankar
core +4 more sources
Conjecture jackson dalam subgrapheuler [PDF]
, 1998 ABSTRAK Conjecture Jackson menyatakan bahwa jika G .merupakan graph 2-garis terhubung, maka G mempunyai subgraph euler H dengan IV(H)I ?. 2, sedemikian sehingga untuk setiap komponen F dari G-V(H) terdapat aebanyak-banyaknya 3 garis antara F dan H ...
Sukiyati , Sukiyati
core
Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time. [PDF]
Algorithms Mol Biol, 2023 Schmidt S, Alanko JN.
europepmc +2 more sources
Eulerian and Hamiltonian properties of Gallai and anti-Gallai middle graphs
, 2022 The Gallai middle graph ΓM(G) of a graph G = (V, E) is the graph whose vertex set is V ∪ E and two edges ei, ej ∈ E are adjacent in ΓM(G), if they are adjacent edges of G and do not lie on a same triangle in G, or if ei = uv ∈ E then ei is adjacent to u and v in ΓM(G).
Goyal, Shanu, Jain, Dilip
openaire +1 more source
The Salesman's Improved Tours for Fundamental Classes
, 2017 Finding the exact integrality gap $\alpha$ for the LP relaxation of the metric Travelling Salesman Problem (TSP) has been an open problem for over thirty years, with little progress made.
Boyd, Sylvia, Sebö, András
core
Hamiltonian Strongly Regular Graphs [PDF]
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected non-Hamiltonian strongly regular graph on fewer than 99 vertices.Distance-regular graphs;Hamilton cycles JEL ...
Brouwer, A.E., Haemers, W.H.
core +1 more source