Results 1 to 10 of about 251,897 (248)
Phase-matching free pulse retrieval based on plasma-induced defocusing [PDF]
EPJ Web of Conferences, 2023 A phase-matching free pulse retrieval technique based on plasma-induced defocusing in a rare gas is presented. Based on a pump-probe setup, this technique uses a moderately intense pump laser pulse for ionizing the medium, creating in turn an ultrafast ...
Béjot Pierre +4 more
doaj +1 more source
Strong chromatic index of products of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Graphs and ...
Olivier Togni
doaj +1 more source
Large Induced Matchings in Random Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2021 Given a large graph $H$, does the binomial random graph $G(n,p)$ contain a copy of $H$ as an induced subgraph with high probability? This classical question has been studied extensively for various graphs $H$, going back to the study of the independence number of $G(n,p)$ by Erd s and Bollob s, and Matula in 1976.
Cooley, Oliver +3 more
openaire +3 more sources
Matching book thickness of generalized Petersen graphs
Electronic Journal of Graph Theory and Applications, 2022 The matching book embedding of a graph G is to place its vertices on the spine, and arrange its edges on the pages so that the edges in the same page do not intersect each other and the edges induced subgraphs of each page are 1-regular.
Zeling Shao, Huiru Geng, Zhiguo Li
doaj +1 more source
Antimatroids induced by matchings [PDF]
Discrete Applied Mathematics, 2019 We explore novel connections between antimatroids and matchings in bipartite graphs. In particular, we prove that a combinatorial structure induced by stable matchings or maximum-weight matchings is an antimatroid. Moreover, we demonstrate that every antimatroid admits such a representation by stable matchings and maximum-weight matchings.
Yasushi Kawase, Yutaro Yamaguchi
openaire +3 more sources
Intersubband-transition-induced phase matching [PDF]
Optics Letters, 1994 We suggest the use of the refractive-index changes associated with the intersubband transitions in quantum wells for phase matching in nonlinear materials. An improvement in the conversion efficiency of mid-IR second-harmonic generation by almost 2 orders of magnitude over non-phase-matched bulk GaAs is predicted.
G, Almogy, M, Segev, A, Yariv
openaire +2 more sources
Optically Induced Nonlinear Cubic Crystal System for 3D Quasi‐Phase Matching
Advanced Photonics Research, 2022 Quasi‐phase matching (QPM) is a technique in nonlinear optics for achieving efficient energy exchange among optical waves at different frequencies, by spatially modulating the quadratic nonlinearity (χ (2)) of the medium. To realize the full potential of
Yesheng Chen +9 more
doaj +1 more source
Finding Dominating Induced Matchings in P9-Free Graphs in Polynomial Time
Discussiones Mathematicae Graph Theory, 2022 Let G = (V, E) be a finite undirected graph. An edge subset E′ ⊆ E is a dominating induced matching (d.i.m.) in G if every edge in E is intersected by exactly one edge of E′. The Dominating Induced Matching (DIM) problem asks for the existence of a d.i.m.
Brandstädt Andreas, Mosca Raffaele
doaj +1 more source
Some Results on Dominating Induced Matchings
Graphs and Combinatorics, 2022 Let $G$ be a graph, a dominating induced matching (DIM) of $G$ is an induced matching that dominates every edge of $G$. In this paper we show that if a graph $G$ has a DIM, then $ (G) \leqslant 3$. Also, it is shown that if $G$ is a connected graph whose all edges can be partitioned into DIM, then $G$ is either a regular graph or a biregular graph and
S. Akbari +4 more
openaire +3 more sources
On the induced matching problem
Journal of Computer and System Sciences, 2011 We study extremal questions on induced matchings in several natural graph classes. We argue that these questions should be asked for twinless graphs, that is graphs not containing two vertices with the same neighborhood. We show that planar twinless graphs always contain an induced matching of size at least $n/40$ while there are planar twinless graphs
Kanj, Iyad A. +3 more
openaire +6 more sources