Results 41 to 50 of about 152,187 (305)
The Forcing Domination Number of Hamiltonian Cubic Graphs [PDF]
, 2009 The authors presented a sequence of Hamiltonian cubic graphs whose domination numbers are sharp and in this paper we study forcing domination number for those ...
H. Abdollahzadeh Ahangar +3 more
core +1 more source
Discussiones Mathematicae Graph Theory, 2015 For integers k and n with 2 ≤ k ≤ n − 1, a graph G of order n is k-path pancyclic if every path P of order k in G lies on a cycle of every length from k + 1 to n. Thus a 2-path pancyclic graph is edge-pancyclic.
Bi Zhenming, Zhang Ping
doaj +1 more source
Condensed Forms for Skew-Hamiltonian/Hamiltonian Pencils [PDF]
SIAM Journal on Matrix Analysis and Applications, 2000 In this paper we consider real or complex skew-Hamiltonian/Hamiltonian pencils $\lambda S-H$, i.e., pencils where S is a skew-Hamiltonian and H is a Hamiltonian matrix. These pencils occur, for example, in the theory of continuous time, linear quadratic optimal control problems.
openaire +2 more sources
A First Class Constraint Generates Not a Gauge Transformation, But a Bad Physical Change: The Case of Electromagnetism [PDF]
, 2013 In Dirac-Bergmann constrained dynamics, a first-class constraint typically does not _alone_ generate a gauge transformation. By direct calculation it is found that each first-class constraint in Maxwell's theory generates a change in the electric field ...
Pitts, J. Brian, J. Brian Pitts
core +2 more sources
Model of a three-qubit cluster in a thermal bath
Физико-химические аспекты изучения кластеров, наноструктур и наноматериалов, 2023 This work studies a mathematical model of a quantum cluster consisting of three qubits and being in thermal equilibrium with the environment. The effective Hamiltonian is invariant under permutations of qubits and consists of two parts. The first part is
E. Andre, A.N. Tsirulev
doaj +1 more source
Classical and Quantum Gravity, 2005 More detailed description of the numerical implementation added and some typos corrected. Version accepted for publication in Class.
openaire +3 more sources
Hamiltonian purification [PDF]
Journal of Mathematical Physics, 2015 The problem of Hamiltonian purification introduced by Burgarth et al. [Nat. Commun. 5, 5173 (2014)] is formalized and discussed. Specifically, given a set of non-commuting Hamiltonians {h1, …, hm} operating on a d-dimensional quantum system ℋd, the problem consists in identifying a set of commuting Hamiltonians {H1, …, Hm} operating on a larger dE ...
Davide Orsucci +6 more
openaire +3 more sources
Some properties of the generalized sierpiński gasket graphs [PDF]
Transactions on CombinatoricsThe generalized Sierpiński gasket graphs $S[G,t]$ are introduced as the graphs obtained from the Sierpiński graphs $S(G,t)$ by contracting single edges between copies of previous phases.
Fatemeh Attarzadeh +2 more
doaj +1 more source
Heliyon, 2023 Under the influence of axial forces and uniform temperature variations, the thermal buckling and postbuckling of composite beams reinforced of functionally graded multilayer graphene platelets (GPLs) resting on nonlinear elastic foundations are examined.
Ying Lv, Jing Zhang, Lianhe Li
doaj +1 more source
Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes [PDF]
Journal of Combinatorial Theory, Series B, 2021 We introduce and study a $d$-dimensional generalization of Hamiltonian cycles in graphs - the Hamiltonian $d$-cycles in $K_n^d$ (the complete simplicial $d$-complex over a vertex set of size $n$). Those are the simple $d$-cycles of a complete rank, or, equivalently, of size $1 + {{n-1} \choose d}$.
Rogers Mathew +3 more
openaire +4 more sources