Buscar
Mostrando ítems 1-10 de 12
Artículo
Quantum social networks
(IOP Science, 2012)
We introduce a physical approach to social networks (SNs) in which each actor is characterized by a yes–no test on a physical system. This allows us to consider SNs beyond those originated by interactions based on ...
Artículo
A sufficient degree condition for a graph to contain all trees of size k
(Springer, 2011)
The Erdös–Sós conjecture says that a graph G on n vertices and number of edges e(G) > n(k − 1)/2 contains all trees of size k. In this paper we prove a sufficient condition for a graph to contain every tree of size k ...
Artículo
On the determining number and the metric dimension of graphs
(Combinatorics.org, 2010)
This paper initiates a study on the problem of computing the difference between the metric dimension and the determining number of graphs. We provide new proofs and results on the determining number of trees and Cartesian ...
Artículo
Distinguishing graphs by their left and right homomorphism profiles
(Elsevier, 2011)
We introduce a new property of graphs called ‘q-state Potts unique-ness’ and relate it to chromatic and Tutte uniqueness, and also to ‘chromatic–flow uniqueness’, recently studied by Duan, Wu and Yu. We establish for ...
Artículo
Compact set of invariants characterizing graph states of up to eight qubits
(American Physical Society, 2009)
The set of entanglement measures proposed by Hein, Eisert, and Briegel for n-qubit graph states [Phys. Rev. A 69, 062311 (2004)] fails to distinguish between inequivalent classes under local Clifford operations if n≥7. On ...
Artículo
Industrial Steel Heat Treating: Numerical Simulation of Induction Heating and Aquaquenching Cooling with Mechanical Effects
(MDPI, 2021)
This paper summarizes a mathematical model for the industrial heating and cooling processes of a steel workpiece corresponding to the steering rack of an automobile. The general purpose of the heat treatment process is ...
Artículo
Extremal K-(s,K-t)-free bipartite graphs
(Association DMTCS, 2008)
In this paper new exact values of the Zarankiewicz function z(m, n; s, t) are obtained assuming certain requirements on the parameters. Moreover, all the corresponding extremal graphs are characterized. Finally, an extension ...
Artículo
Entanglement in eight-qubit graph states
(Elsevier, 2009)
Any 8-qubit graph state belongs to one of the 101 equivalence classes under local unitary operations within the Clifford group. For each of these classes we obtain a representative which requires the minimum number of ...
Artículo
Geometric Objects and Cohomology Operations
(Cornell University, 2012)
Cohomology operations (including the cohomology ring) of a geometric object are finer algebraic invariants than the homology of it. In the literature, there exist various algorithms for computing the homology groups of ...
Artículo
On the Ramsey numbers for stars versus complete graphs
(Elsevier, 2010)
For graphs G1, . . . , Gs, the multicolor Ramsey number R(G1, . . . , Gs) is the smallest integer r such that if we give any edge col-oring of the complete graph on r vertices with s colors then there exists a monochromatic copy ...