Results 21 to 30 of about 70,409 (209)
Poincar\'e recurrence theorem and the strong CP-problem [PDF]
, 2006 The existence in the physical QCD vacuum of nonzero gluon condensates, such as $$, requires dominance of gluon fields with finite mean action density. This naturally allows any real number value for the unit ``topological charge'' $q$ characterising the ...
Alex C. Kalloniatis +5 more
core +2 more sources
Conditional resolvability in graphs: a survey
International Journal of Mathematics and Mathematical Sciences, 2004 For an ordered set W={w1,w2,…,wk} of vertices and a vertex v in a connected graph G, the code of v with respect to W is the k-vector cW(v)=(d(v,w1),d(v,w2),…,d(v,wk)), where d(x,y) represents the distance between the vertices x and y.
Varaporn Saenpholphat, Ping Zhang
doaj +1 more source
Partition Dimension of Generalized Hexagonal Cellular Networks and Its Application
IEEE AccessThe notion of partition dimension was initially introduced in the field of graph theory, primarily to examine distances between vertices. The local partition dimension extends this idea by incorporating specific conditions into how vertices are ...
Rabnawaz Bhatti +3 more
doaj +1 more source
Trees with Certain Locating-chromatic Number
Journal of Mathematical and Fundamental Sciences, 2016 The locating-chromatic number of a graph G can be defined as the cardinality of a minimum resolving partition of the vertex set V(G) such that all vertices have distinct coordinates with respect to this partition and every two adjacent vertices in G are ...
Dian Kastika Syofyan +2 more
doaj +1 more source
On the Locating Chromatic Number of Certain Barbell Graphs
International Journal of Mathematics and Mathematical Sciences, 2018 The locating chromatic number of a graph G is defined as the cardinality of a minimum resolving partition of the vertex set V(G) such that all vertices have distinct coordinates with respect to this partition and every two adjacent vertices in G are not ...
Asmiati +2 more
doaj +1 more source
THE PARTITION DIMENSION OF CYCLE BOOKS GRAPH B_(m,n) WITH A COMMON PATH P_2
BarekengSuppose is a connected graph with elements of a set of vertices denoted by and a subset of . The distance between and is the shortest distance to every vertex in . Let be a partition of , where each subset belongs to .
Jaya Santoso, Darmaji Darmaji
doaj +1 more source
On the strong partition dimension of graphs [PDF]
, 2013 We present a different way to obtain generators of metric spaces having the property that the ``position'' of every element of the space is uniquely determined by the distances from the elements of the generators.
Yero, Ismael Gonzalez
core
FEBS Letters, EarlyView.We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
FEBS Letters, EarlyView.Plasma membranes contain dynamic nanoscale domains that organize lipids and receptors. Because viruses operate at similar scales, this architecture shapes early infection steps, including attachment, receptor engagement, and entry. Using influenza A virus and HIV‐1 as examples, we highlight how receptor nanoclusters, multivalent glycan interactions ...
Jan Schlegel, Christian Sieben
wiley +1 more source
The Mixed Partition Dimension: A New Resolvability Parameter in Graph Theory
IEEE AccessIn this article, we introduce a novel graph-theoretical parameter called the mixed partition dimension and apply it to the path graph and the hexagonal network.
Siti Norziahidayu Amzee Zamri +4 more
doaj +1 more source