Results 101 to 110 of about 445,292 (276)
Distinguishing number of vertex-transitive graphs of valency 4 [PDF]
Apart from finitely many exceptions, connected vertex-transitive graphs of valency at most 3 have distinguishing number 2. Recently, Florian Lehner and I determined the distinguishing number of all vertex-transitive graphs of valency 4.
Verret, Gabriel
core
General Vertex-Distinguishing Total Colorings of Complete Bipartite Graphs
Let G be a simple graph. A general total coloring f of G refers to a coloring of the vertices and edges of G. Let C(x) be the set of colors of vertex x and edges incident with x under f. For a general total coloring f of G in which k colors are available,
Xiang’en Chen, Ting Li
doaj +1 more source
The author presents a new conception of distinguishing taxonomic units, while taking into .account a precise class of characters, It is shown on the taxonomy of species of Delia Dum., Spergula L., and Spergularia Presl., growning in Poland and based on ...
Tadeusz Kowal
doaj +1 more source
On Computing the Distinguishing Numbers of Trees and Forests [PDF]
Let $G$ be a graph. A vertex labeling of $G$ is distinguishing if the only label-preserving automorphism of $G$ is the identity map. The distinguishing number of $G$, $D(G)$, is the minimum number of labels needed so that $G$ has a distinguishing labeling. In this paper, we present $O(n \log n)$-time algorithms that compute the distinguishing numbers
openaire +2 more sources
The physical dimensions and shape of bacterial cells define the surface area available to acquire nutrients and the volume available for synthesizing proteins and DNA. Here, we use computational systems biology to decode the importance of cell geometry as a major determinant of prokaryotic phenotype, including growth rate and metabolic efficiency. This
Ross P. Carlson +6 more
wiley +1 more source
The Distinguishing Number and Posets, Part I [PDF]
We introduce the distinguishing numbers of partially ordered sets. This study has given us the opportunity to apply classic results in poset theory to obtain results about this parameter.
Trenk, Ann
core
We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source
On distinguishing and distinguishing chromatic numbers of hypercubes [PDF]
The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d colors that is not preserved by any nontrivial automorphism.
Klöckl, Werner
core +1 more source
Neighbor Sum Distinguishing Total Choosability of IC-Planar Graphs
Two distinct crossings are independent if the end-vertices of the crossed pair of edges are mutually different. If a graph G has a drawing in the plane such that every two crossings are independent, then we call G a plane graph with independent crossings
Song Wen-Yao +2 more
doaj +1 more source
From mice to humans—divergent strategies for intestinal homeostasis and regeneration
Recent advances such as organoid genome editing, xenotransplantation, imaging, and whole‐genome sequencing have enabled direct studies of human intestinal stem cells (ISCs). These studies reveal species‐specific features, including slower ISC proliferation, distinct injury responses, slower somatic mutation accumulation in humans, and an inverse ...
Keiko Ishikawa +2 more
wiley +1 more source

