Results 91 to 100 of about 140,264 (286)
Let Hn be the set of nĂn complex Hermitian matrices and đ«n (resp., đŻn) be the set of all idempotent (resp., tripotent) matrices in Hn. In l-partite quantum system Hm1Tml=â1lHmi, â1lđ«mi (resp., â1lđŻmi) denotes the set of all decomposable elements â1lAi ...
Jinli Xu, Baodong Zheng, Hongmei Yao
doaj +1 more source
Path Degeneracy and Applications
ABSTRACT In this work, we relate girth and pathâdegeneracy in classes with subâexponential expansion, with explicit bounds for classes with polynomial expansion and proper minorâclosed classes that are tight up to a constant factor (and tight up to second order terms if a classical conjecture on existence of g $g$âcages is verified). As an application,
Yuquan Lin, Patrice Ossona de Mendez
wiley +1 more source
Characterization of Graphs Without Even F $F$âOrientations
ABSTRACT A graph G $G$ is 1âextendable if every edge belongs to at least one 1âfactor of G $G$. Let G $G$ be a graph with a 1âfactor F $F$. Then an even (odd) F $F$ âorientation of G $G$ is an orientation in which each F $F$âalternating cycle has exactly an even (odd) number of edges directed in the same fixed direction around the cycle.
Marién Abreu +3 more
wiley +1 more source
Sponsalia plantarum (Diss., Resp. J. G. Wahlbom) (1746)
SPONSALIA PLANTARUM (DISS., RESP. J. G. WAHLBOM) (1746) Bibliotheque National de France, Gallica: Digital Prints. (-) Sponsalia plantarum (Diss., Resp. J. G.
Linnaeus, Carl
core +2 more sources
ABSTRACT A 2âedgeâcoloured graph G $G$ is called locally complete if for each vertex v $v$, the vertices adjacent to v $v$ through edges of the same colour induce a complete subgraph in G $G$. Locally complete 2âedgeâcoloured graphs have nice properties, and there exists a polynomial algorithm to decide whether such a graph has an alternating ...
JĂžrgen BangâJensen, Jing Huang
wiley +1 more source
Multiplicative Perturbations of Convoluted C-Cosine Functions and Convoluted C-Semigroups
We obtain the multiplicative perturbation theorems for convoluted C-cosine functions (resp., convoluted C-semigroups) and n-times integrated C-cosine functions (resp., n-times integrated C-semigroups) for nââ.
Fang Li, Huiwen Wang, Jun Zhang
doaj +1 more source
RESP, mĂĄs internacional [PDF]
Marco, A., Arroyo, J.M.
openaire +3 more sources
A Structural Description of Zykov and Blanche Descartes Graphs
ABSTRACT Around 1950, Zykov and Blanche Descartes proposed the two first explicit constructions of triangleâfree graphs with arbitrarily large chromatic number. We define a Zykov (resp. Blanche Descartes) graph as any induced subgraph of a graph created using Zykov's construction (resp. Blanche Descartes's).
Malory Marin +3 more
wiley +1 more source
Ueber FrĂŒhbehandlung der Osteomyelitis durch Trepanation resp. Aufmeisselung des Knochens
UEBER FRĂHBEHANDLUNG DER OSTEOMYELITIS DURCH TREPANATION RESP. AUFMEISSELUNG DES KNOCHENS Ueber FrĂŒhbehandlung der Osteomyelitis durch Trepanation resp. Aufmeisselung des Knochens ([1]) Binding ( - ) Title page ([1]) Dedication ([3])
Schwabe, Adolf
core +1 more source
Some Results on Fibrewise Topological Spaces
In this paper we define and study new concepts of functions on fibrewise  topological spaces  over  B namely,  fibrewise  weakly  (resp., closure, strongly) continuoac; funttions which are analogous of weakly (resp., closure,  strongly)  continuous
Y.Y. Yousif
doaj

