Results 81 to 90 of about 1,556,418 (219)

Dominating induced matchings of finite graphs and regularity of edge ideals [PDF]

open access: yesarXiv, 2014
The regularity of an edge ideal of a finite simple graph $G$ is at least the induced matching number of $G$ and is at most the minimum matching number of $G$. If $G$ possesses a dominating inuduced matching, i.e., an induced matching which forms a maximal matching, then the induced matching number of $G$ is equal to the minimum matching number of $G ...
arxiv  

Smart Matching

open access: yes, 2010
To appear in The 9th International Conference on Mathematical Knowledge Management: MKM ...
ASPERTI, ANDREA, E. Tassi
openaire   +3 more sources

Graphs with Integer Matching Polynomial Roots [PDF]

open access: yesarXiv, 2016
In this paper, we study graphs whose matching polynomial have only integer zeros. A graph is matching integral if the zeros of its matching polynomial are all integers. We characterize all matching integral traceable graphs.. We show that apart from K7 n (E(C3) [ E(C4)) there is no connected k-regular matching integral graph if k ? 2.
arxiv  

Matching Logic

open access: yesLogical Methods in Computer Science, 2017
This paper presents matching logic, a first-order logic (FOL) variant for specifying and reasoning about structure by means of patterns and pattern matching. Its sentences, the patterns, are constructed using variables, symbols, connectives and quantifiers, but no difference is made between function and predicate symbols. In models, a pattern evaluates
openaire   +4 more sources

The Matching Plan for Internship Placement

open access: bronze, 1952
F J Mullin, John M. Stalnaker
openalex   +1 more source

Home - About - Disclaimer - Privacy