Results 41 to 50 of about 152,220 (203)
, 2015 A spanning subgraph $F$ of a graph $G$ is called perfect if $F$ is a forest, the degree $d_F(x)$ of each vertex $x$ in $F$ is odd, and each tree of $F$ is an induced subgraph of $G$. We provide a short proof of the following theorem of A.D. Scott (Graphs
Gutin, Gregory
core +2 more sources
Constructing the Mate of Cospectral 5-regular Graphs with and without a Perfect Matching
Mohyla Mathematical Journal, 2022 The problem of finding a perfect matching in an arbitrary simple graph is well known and popular in graph theory. It is used in various fields, such as chemistry, combinatorics, game theory etc.
V. Solomko, V. Sobolev
semanticscholar +1 more source
Note on Perfect Forests in Digraphs [PDF]
, 2015 A spanning subgraph $F$ of a graph $G$ is called {\em perfect} if $F$ is a forest, the degree $d_F(x)$ of each vertex $x$ in $F$ is odd, and each tree of $F$ is an induced subgraph of $G$.
Bang-Jensen, Gutin, Scott
core +2 more sources
Perfect edge domination : hard and solvable cases [PDF]
, 2017 Let G be an undirected graph. An edge of Gdominates itself and all edges adjacent to it. A subset E′ of edges of G is an edge dominating set of G, if every edge of the graph is dominated by some edge of E′. We say that E′ is a perfect edge dominating set
Lin, Min Chih +3 more
core +3 more sources
Design of Virtual Network Mapping Algorithm Based on K-Best Perfect Matchings of Bipartite Graph
Dianxin kexue, 2014 To improve the feasibility of virtual node mapping，grounded on feasibility test theorem and node rank indicators used to measure node availability，the virtual network mapping iterative algorithm based on K-best perfect matchings of bipartite graph was ...
Jianjun Yu, Chunming Wu
doaj +2 more sources
Computational Modeling of Reticular Materials: The Past, the Present, and the Future
Advanced Materials, EarlyView.Reticular materials are advanced materials with applications in emerging technologies. A thorough understanding of material properties at operating conditions is critical to accelerate the deployment at an industrial scale. Herein, the status of computational modeling of reticular materials is reviewed, supplemented with topical examples highlighting ...
Wim Temmerman +3 more
wiley +1 more source
Cloaking and Antennas: From Theoretical Paradigms to Next‐Generation Intelligent Systems
Advanced Optical Materials, EarlyView.The inception of electromagnetic cloaking sparked an immediate question: Can antennas be made invisible? Two decades later, this review charts the intertwined progress of major cloaking strategies (from transformation optics to scattering cancellation), metasurface technology, and their application to antennas, revealing how AI‐enabled devices are ...
Helen Guo, Xun Li
wiley +1 more source
On Perfect Matchings and tilings in uniform Hypergraphs
, 2018 In this paper we study some variants of Dirac-type problems in hypergraphs. First, we show that for $k\ge 3$, if $H$ is a $k$-graph on $n\in k\mathbb N$ vertices with independence number at most $n/p$ and minimum codegree at least $(1/p+o(1))n$, where $p$
Han, Jie
core +1 more source
Advanced Intelligent Discovery, EarlyView.Combining machine learning and probabilistic statistical learning is a powerful way to discover and design new materials. A variety of machine learning approaches can be used to identify promising candidates for target applications, and causal inference can help identify potential ways to make them a reality.
Jonathan Y. C. Ting, Amanda S. Barnard
wiley +1 more source
Local Search and the Evolution of World Models
Topics in Cognitive Science, EarlyView., 2023 Abstract An open question regarding how people develop their models of the world is how new candidates are generated for consideration out of infinitely many possibilities. We discuss the role that evolutionary mechanisms play in this process. Specifically, we argue that when it comes to developing a global world model, innovation is necessarily ...
Neil R. Bramley +3 more
wiley +1 more source