Results 61 to 70 of about 505,548 (331)
Conditional Strong Matching Preclusion of the Alternating Group Graph
Theory and Applications of Graphs, 2019 The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings.
Mohamad Adballah, Eddie Cheng
doaj +1 more source
Perfect double Italian domination of a graph
AKCE International Journal of Graphs and Combinatorics, 2023 For a graph [Formula: see text] with [Formula: see text] and [Formula: see text], a perfect double Italian dominating function is a function [Formula: see text] having the property that [Formula: see text], for every vertex [Formula: see text] with ...
Guoliang Hao +2 more
doaj +1 more source
Discrete Mathematics, 1990 An edge uv of a graph G is called a wing if there exists a chordless path with vertices u, v, x, y and edges uv, vx, xy. The wing-graph W(G) of a graph G is a graph having the same vertex set as G; uv is an edge in W(G) if and only if uv is a wing in G. A graph G is saturated if G is isomorphic to W(G).
openaire +3 more sources
Perfect partition of some regular bipartite graphs [PDF]
, 2012 A graph has a perfect partition if all its perfect matchings can be partitioned so that each part is a 1-factorization of the graph. Let $L_{rm, r}=K_{rm,rm}-mK_{r,r}$. We first give a formula to count the number of perfect matchings of $L_{rm, r}$, then
Li, Chi-Kwong, Soosiah, Jeff, Yu, Gexin
core
On some Graphs with a Unique Perfect Matching
, 2017 We show that deciding whether a given graph $G$ of size $m$ has a unique perfect matching as well as finding that matching, if it exists, can be done in time $O(m)$ if $G$ is either a cograph, or a split graph, or an interval graph, or claw-free ...
Chaplick, S. +3 more
core +1 more source
Advanced Engineering Materials, EarlyView.In this study, the mechanical response of Y‐shaped core sandwich beams under compressive loading is investigated, using deep feed‐forward neural networks (DFNNs) for predictive modeling. The DFNN model accurately captures stress–strain behavior, influenced by design parameters and loading rates.
Ali Khalvandi +4 more
wiley +1 more source
Constructing perfect phylogenies and proper triangulations for three-state characters
Algorithms for Molecular Biology, 2012 In this paper, we study the problem of constructing perfect phylogenies for three-state characters. Our work builds on two recent results. The first result states that for three-state characters, the local condition of examining all subsets of three ...
Gysel Rob, Lam Fumei, Gusfield Dan
doaj +1 more source
Decomposition of perfect graphs
Journal of Combinatorial Theory, Series B, 1987 In this paper we describe general composition and decomposition schemes for perfect graphs, which covers almost all recent results in this area, e.g. the amalgam and the 2-amalgam split. Our approach is based on the consideration of induced cycles and their complements in perfect graphs (as opposed to the consideration of cycles for defining ...
openaire +2 more sources
Perfect commuting graphs [PDF]
Journal of Group Theory, 2016 Abstract We classify the finite quasisimple groups whose commuting graph is perfect and we give a general structure theorem for finite groups whose commuting graph is perfect.
Britnell JR, Gill N
openaire +4 more sources
Advanced Engineering Materials, EarlyView.Molecular dynamics simulations are advancing the study of ribonucleic acid (RNA) and RNA‐conjugated molecules. These developments include improvements in force fields, long‐timescale dynamics, and coarse‐grained models, addressing limitations and refining methods.
Kanchan Yadav, Iksoo Jang, Jong Bum Lee
wiley +1 more source