Results 61 to 70 of about 53,013 (201)
Journal of Graph Theory, EarlyView.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
A Fast Algorithm for Computing Binomial Coefficients Modulo Powers of Two
The Scientific World Journal, 2013 I present a new algorithm for computing binomial coefficients modulo . The proposed method has an preprocessing time, after which a binomial coefficient with can be computed modulo in time.
Mugurel Ionut Andreica
doaj +1 more source
The Minimal Nonplanar Strong Digraphs
Journal of Graph Theory, EarlyView.ABSTRACT Kuratowski's theorem says that the minimal (under subgraph containment) graphs that are not planar are the subdivisions of K 5 ${K}_{5}$ and of K 3 , 3 ${K}_{3,3}$. Here we study the minimal (under subdigraph containment) strongly‐connected digraphs that are not planar.
Stephen Bartell, Paul Seymour
wiley +1 more source
Journal of Graph Theory, EarlyView.ABSTRACT Lovász et al. proved that every six‐edge‐connected graph has a nowhere‐zero three‐flow. In fact, they proved a more technical statement, which says that there exists a nowhere‐zero three‐flow that extends the flow prescribed on the incident edges of a single vertex z $z$ with bounded degree. We extend this theorem of Lovász et al.
Arnbjörg Soffía Árnadóttir +5 more
wiley +1 more source
Amenability and Contractibility Modulo an Ideal of Banach Algebras
Abstract and Applied Analysis, 2014 We investigate the concept of amenability modulo an ideal of Banach algebra, showing that amenability modulo an ideal can be characterized by the existence of virtual and approximate diagonal modulo an ideal.
Hamidreza Rahimi, Elham Tahmasebi
doaj +1 more source
From Planar to 3D Nanophotonic Lenses: Advancing Design, Fabrication, and Applications
Laser &Photonics Reviews, EarlyView.Three‐dimensional nanophotonic lenses are enabled by an integrated workflow that links design parameterization, full‐wave electromagnetic simulation, computational optimization, and freeform fabrication. This Review summarizes how these tools expand optical design freedom beyond a single patterned plane by enriching the local meta‐atom response and ...
Wei Zhu +2 more
wiley +1 more source
Rewriting modulo in Deduction modulo
, 2003 International audienceWe study the termination of rewriting modulo a set of equations in the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions and predicates defined by higher-order rewrite rules.
Blanqui, Frédéric, Frédéric Blanqui
core +3 more sources
Peskine Sixfolds and Debarre–Voisin Fourfolds With Associated Cubic Fourfolds
Mathematische Nachrichten, EarlyView.ABSTRACT We develop the notion of Peskine sixfolds with associated K3 surfaces and cubic fourfolds and work out numerical conditions for when these associations occur. In discriminant 24, the first family for which there is an associated cubic fourfold, we identify the cubic explicitly.
Corey Brooke +3 more
wiley +1 more source
Modulo Básico Metalmecánica. 6
, 1992 La cartilla contiene la unidades 15. Doblado manual y 16. Construcción manual de resortes, del Modulo básico metalmecánico. Identifica los elementos empleados en el doblado o curvado manual de alambre y plancha lisa de hierro o acero se explican los ...
core
Fault‐Tolerant Mutual‐Visibility: Complexity and Solutions for Grid‐Like Networks
Networks, EarlyView.ABSTRACT Networks are often modeled using graphs, and within this setting we introduce the notion of k$$ k $$‐fault‐tolerant mutual visibility. Informally, a set of vertices X⊆V(G)$$ X\subseteq V(G) $$ in a graph G$$ G $$ is a k$$ k $$‐fault‐tolerant mutual‐visibility set (k$$ k $$‐ftmv set) if any two non‐adjacent vertices in X$$ X $$ are connected by
Serafino Cicerone +3 more
wiley +1 more source