نتایج جستجو برای: unmixed graph
تعداد نتایج: 198434 فیلتر نتایج به سال:
we define minimal cn-dominating graph $mathbf {mcn}(g)$, commonality minimal cn-dominating graph $mathbf {cmcn}(g)$ and vertex minimal cn-dominating graph $mathbf {m_{v}cn}(g)$, characterizations are given for graph $g$ for which the newly defined graphs are connected. further serval new results are developed relating to these graphs.
For an arbitrary curve Z ⊂ P (possibly reducible, non-reduced, unmixed) lying on a normal surface, the general surface S of high degree containing Z is also normal, but often singular. We compute the class groups of the very general such surface, thereby extending the Noether-Lefschetz theorem (the special case when Z is empty). Our method is an adaptation of Griffiths and Harris’ degeneration ...
We discuss whether the NuTeV anomaly can be explained, compatibly with all other data, by QCD effects (maybe, if the strange sea is asymmetric, or there is a tiny violation of isospin), new physics in propagators or couplings of the vector bosons (not really), loops of supersymmetric particles (no), dimension six operators (yes, for one specific SU(2)L-invariant operator), leptoquarks (not in a...
In this paper, we enumerate the parameter matrices of all perfect $2$-colorings of the Platonic graphs consisting of the tetrahedral graph, the cubical graph, the octahedral graph, the dodecahedral graph, and the icosahedral graph.
a signed graph (marked graph) is an ordered pair $s=(g,sigma)$$(s=(g,mu))$, where $g=(v,e)$ is a graph called the underlyinggraph of $s$ and $sigma:erightarrow{+,-}$$(mu:vrightarrow{+,-})$ is a function. for a graph $g$, $v(g),e(g)$ and $c(g)$ denote its vertex set, edge set and cut-vertexset, respectively. the lict graph $l_{c}(g)$ of a graph $g=(v,e)$is defined as the graph having vertex set ...
let $g$ be a group. the order graph of $g$ is the (undirected)graph $gamma(g)$,those whose vertices are non-trivial subgroups of $g$ and two distinctvertices $h$ and $k$ are adjacent if and only if either$o(h)|o(k)$ or $o(k)|o(h)$. in this paper, we investigate theinterplay between the group-theoretic properties of $g$ and thegraph-theoretic properties of $gamma(g)$. for a finite group$g$, we s...
The chemical composition of core-shell nanoparticle clusters have been determined through principal component analysis (PCA) and independent component analysis (ICA) of an energy-dispersive X-ray (EDX) spectrum image (SI) acquired in a scanning transmission electron microscope (STEM). The method blindly decomposes the SI into three components, which are found to accurately represent the isolate...
The construction of the Bézout matrix in the hybrid resultant formulation involves theories from algebraic geometry. The underlying theory on toric varieties has very nice properties such as the properties of fan (or cones), homogeneous coordinate ring, normality, and Zariski closure are related to the structure of the lattice polytopes in R. This paper presents the application of these propert...
The reader of Parmenides should put himself in the place of the Clazomenian philosophers who have come to Athens to hear the great argument of Socrates with Zeno and Parmenides as recorded in the memory of Antiphon. From it they would learn what Anaxagoras had not made clear, how the nous, alone unmixed, could relate to the atoms in each of which were all difference, the endless process of sepa...
To assist with the development of intelligent mixing systems, it would be useful to be able to extract the loudness balance of sources in an existing musical mixture. The relative-to-mix loudness level of four instrument groups was predicted using the sources extracted by 12 audio source separation algorithms. The predictions were compared with the ground truth loudness data of the original unm...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید