Results 61 to 70 of about 1,716,586 (315)
Bipartite Graphs Associated with Pell, Mersenne and Perrin Numbers
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2019 In this paper, we consider the relationships between the numbers of perfect matchings (1-factors) of bipartite graphs and Pell, Mersenne and Perrin Numbers.
Öteleş Ahmet
doaj +1 more source
Reflexive polytopes arising from perfect graphs
, 2018 Reflexive polytopes form one of the distinguished classes of lattice polytopes. Especially reflexive polytopes which possess the integer decomposition property are of interest.
Hibi, Takayuki, Tsuchiya, Akiyoshi
core +1 more source
Advanced Functional Materials, EarlyView.The chemical composition and band alignment are systematically investigated at the TiO2/InP heterointerface. Thin TiO2 films are deposited by ALD on atomically ordered, P‐terminated p‐InP(100). By combining UPS, XPS, and ab initio molecular dynamics, the atomistic structure and electronic alignment are revealed.
Mohammad Amin Zare Pour +11 more
wiley +1 more source
Quantum Experiments and Graphs: Multiparty States as Coherent Superpositions of Perfect Matchings. [PDF]
Physical Review Letters, 2017 We show a surprising link between experimental setups to realize high-dimensional multipartite quantum states and graph theory. In these setups, the paths of photons are identified such that the photon-source information is never created.
Mario Krenn, Xuemei Gu, A. Zeilinger
semanticscholar +1 more source
Laser‐Induced Graphene from Waste Almond Shells
Advanced Functional Materials, EarlyView.Almond shells, an abundant agricultural by‐product, are repurposed to create a fully bioderived almond shell/chitosan composite (ASC) degradable in soil. ASC is converted into laser‐induced graphene (LIG) by laser scribing and proposed as a substrate for transient electronics.
Yulia Steksova +9 more
wiley +1 more source
Perfect Matchings in Random Octagonal Chain Graphs
Journal of Mathematics, 2021 A perfect matching of a (molecule) graph G is a set of independent edges covering all vertices in G. In this paper, we establish a simple formula for the expected value of the number of perfect matchings in random octagonal chain graphs and present the ...
Shouliu Wei +4 more
doaj +1 more source
Gaussian boson sampling for perfect matchings of arbitrary graphs [PDF]
Physical Review A, 2017 A famously hard graph problem with a broad range of applications is computing the number of perfect matchings, that is the number of unique and complete pairings of the vertices of a graph.
K. Br'adler +4 more
semanticscholar +1 more source
Double Helical Plasmonic Antennas
Advanced Functional Materials, EarlyView.Plasmonic double helical antennas funnel circularly polarized light to the nanoscale, offering strong chiroptical interaction and directional light emission. Extending a single helix design tool, this study combines numerical modeling with experimental validation, revealing large, broadband dissymmetry factors in the visible range.
Aleksei Tsarapkin +7 more
wiley +1 more source
A sharp lower bound on the signless Laplacian index of graphs with (κ,τ)-regular sets
Special Matrices, 2018 A new lower bound on the largest eigenvalue of the signless Laplacian spectra for graphs with at least one (κ,τ)regular set is introduced and applied to the recognition of non-Hamiltonian graphs or graphs without a perfect matching.
Andeelić Milica +2 more
doaj +1 more source
OPEN PACKING NUMBER FOR SOME CLASSES OF PERFECT GRAPHS
Ural Mathematical Journal, 2020 Let \(G\) be a graph with the vertex set \(V(G)\). A subset \(S\) of \(V(G)\) is an open packing set of \(G\) if every pair of vertices in \(S\) has no common neighbor in \(G.\) The maximum cardinality of an open packing set of \(G\) is the open ...
K. Raja Chandrasekar, S. Saravanakumar
doaj +1 more source