Results 51 to 60 of about 402,994 (257)
THE DISTINGUISHING NUMBERS OF MERGED JOHNSON GRAPHS [PDF]
Bulletin of the Korean Mathematical Society, 2015 In present article, we determine the distinguishing number of the merged Johnson graphs which are generalization of both the Kneser graphs and of the Johnson graphs.
Kim, Dongseok +2 more
openaire +2 more sources
Mapping the evolution of mitochondrial complex I through structural variation
FEBS Letters, EarlyView.Respiratory complex I (CI) is crucial for bioenergetic metabolism in many prokaryotes and eukaryotes. It is composed of a conserved set of core subunits and additional accessory subunits that vary depending on the organism. Here, we categorize CI subunits from available structures to map the evolution of CI across eukaryotes. Respiratory complex I (CI)
Dong‐Woo Shin +2 more
wiley +1 more source
Distinguishing between lepton number violating scalars at the LHC
EPJ Web of Conferences, 2013 Scalars with lepton number violating interactions decaying into lepton pairs, as those mediating the see-saw of type II, always include doubly-charged components.
Santamaria Arcadi +3 more
doaj +1 more source
Game distinguishing numbers of Cartesian products
Ars Mathematica Contemporanea, 2017 Summary: The distinguishing number of a graph \(H\) is a symmetry related graph invariant whose study started two decades ago. The distinguishing number \(D\)(\(H\)) is the least integer \(d\) such that \(H\) has a distinguishing \(d\)-coloring. A distinguishing \(d\)-coloring is a coloring \(c\): \(V(H) \to \{1,\ldots, d\}\) invariant only under the ...
Gravier, Sylvain +3 more
openaire +4 more sources
FEBS Letters, EarlyView.Fluorescent probes allow dynamic visualization of phosphoinositides in living cells (left), whereas mass spectrometry provides high‐sensitivity, isomer‐resolved quantitation (right). Their synergistic use captures complementary aspects of lipid signaling. This review illustrates how these approaches reveal the spatiotemporal regulation and quantitative
Hiroaki Kajiho +3 more
wiley +1 more source
Distinguishing number and distinguishing index of neighbourhood corona of two graphs
Contributions to Discrete Mathematics, 2019 The distinguishing number (index) $D(G)$ ($D'(G)$) of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling (edge labeling) with $d$ labels that is preserved only by a trivial automorphism. The neighbourhood corona of two graphs $G_1$ and $G_2$ is denoted by $G_1 \star G_2$ and is the graph obtained by taking one copy of ...
Alikhani, Saeid, Soltani, Samaneh
openaire +3 more sources
FEBS Letters, EarlyView.This perspective highlights emerging insights into how the circadian transcription factor CLOCK:BMAL1 regulates chromatin architecture, cooperates with other transcription factors, and coordinates enhancer dynamics. We propose an updated framework for how circadian transcription factors operate within dynamic and multifactorial chromatin landscapes ...
Xinyu Y. Nie, Jerome S. Menet
wiley +1 more source
On the Distance Pattern Distinguishing Number of a Graph
Journal of Applied Mathematics, 2014 Let G=(V,E) be a connected simple graph and let M be a nonempty subset of V. The M-distance pattern of a vertex u in G is the set of all distances from u to the vertices in M.
Sona Jose, Germina K. Augustine
doaj +1 more source
A classification model for distinguishing copy number variants from cancer-related alterations
BMC Bioinformatics, 2010 Background Both somatic copy number alterations (CNAs) and germline copy number variants (CNVs) that are prevalent in healthy individuals can appear as recurrent changes in comparative genomic hybridization (CGH) analyses of tumors.
Olshen Adam B +2 more
doaj +1 more source
Distinguishing Number of Countable Homogeneous Relational Structures [PDF]
The Electronic Journal of Combinatorics, 2010 The distinguishing number of a graph $G$ is the smallest positive integer $r$ such that $G$ has a labeling of its vertices with $r$ labels for which there is no non-trivial automorphism of $G$ preserving these labels. In early work, Michael Albertson and Karen Collins computed the distinguishing number for various finite graphs, and more recently ...
Laflamme, C. +2 more
openaire +3 more sources