Results 11 to 20 of about 1,357,146 (299)
Connected Factors in Graphs ? a Survey [PDF]
A subgraph \(F\) of a graph \(G\) is called a factor of \(G\) if \(V(F)= V(G)\) and \(E(F)\subseteq E(G)\). In other words \(F\) is a spanning subgraph of \(G\). A survey of factors of \(G\) that add additional restrictions on \(F\) are studied in this paper. For example, if \(f\) is a function from \(V(G)\) into the nonnegative integers, then \(F\) is
Vestergaard, Preben Dahl +1 more
openaire +3 more sources
Approximability of Connected Factors [PDF]
Finding a d-regular spanning subgraph (or d-factor) of a graph is easy by Tutte's reduction to the matching problem. By the same reduction, it is easy to find a minimal or maximal d-factor of a graph. However, if we require that the d-factor is connected, these problems become NP-hard - finding a minimal connected 2-factor is just the traveling ...
Kamiel Cornelissen +4 more
openaire +4 more sources
Connected k-factors in bipartite graphs
Let $k,l$ be two positive integers. An $S_{k,l}$ is a graph obtained from disjoint $K_{1,k}$ and $K_{1,l}$ by adding an edge between the $k$-degree vertex in $K_{1,k}$ and the $l$-degree vertex in $K_{1,l}$. An {\em $S_{k,l}$-free} graph is a graph containing no induced subgraph isomorphic to $S_{k,l}$.
Yandong Bai, Binlong Li
openaire +3 more sources
Factorization connecting continuum & lattice TMDs
Abstract Transverse-momentum-dependent parton distribution functions (TMDs) can be studied from first principles by a perturbative matching onto lattice-calculable quantities: so-called lattice TMDs, which are a class of equal-time correlators that includes quasi-TMDs and TMDs in the Lorentz-invariant approach.
Markus A. Ebert +3 more
openaire +4 more sources
Connecting Metabolic Pathways: Sigma Factors in Streptomyces spp.
The gram-positive filamentous bacterium Streptomyces is one of the largest resources for bioactive metabolites, particularly antibiotics. Antibiotic production and other metabolic processes are tightly regulated at the transcriptional level.
Di Sun +3 more
doaj +1 more source
The influence of interstage channel on efficiency of molecular drag stage in hybrid turbomolecular pump [PDF]
The interstage channel is one of the factors affecting the efficiency of the molecular drag stage in a hybrid turbomolecular pump (TMP). The influence of parameters of the channel on the pumping performance of the molecular drag stage is investigated ...
J. A. Shostak +4 more
doaj +1 more source
Embedding Irregular Colorings into Connected Factorizations
For $r:=(r_1,\dots,r_k)$, an $r$-factorization of the complete $λ$-fold $h$-uniform $n$-vertex hypergraph $λK_n^h$ is a partition of (the edges of) $λK_n^h$ into $F_1,\dots, F_k$ such that for $i=1,\dots,k$, $F_i$ is $r_i$-regular and spanning. Suppose that $n \geq (h-1)(2m-1)$.
Amin Bahmanian, Anna Johnsen
openaire +2 more sources
Simple predictions from ALCOR_c for rehadronisation of charmed quark matter [PDF]
We study the production of charmed hadrons with the help of ALCOR_c, the algebraic coalescence model for rehadronisation of charmed quark matter. Mesonic ratios are introduced as factors connecting various antibaryon to baryon ratios.
+15 more
core +2 more sources
Genome-wide signatures of transcription factor activity: connecting transcription factors, disease, and small molecules. [PDF]
Identifying transcription factors (TF) involved in producing a genome-wide transcriptional profile is an essential step in building mechanistic model that can explain observed gene expression data.
Jing Chen +6 more
doaj +1 more source
A novel competing failure model considering intermission is established in this paper, which is appropriate for aircraft connecting-rod-type cabin door retraction mechanism.
LIU Jingyi +3 more
doaj +1 more source

