izvor podataka: crosbi
✓
Counting perfect matchings in n-extendable graphs (CROSBI ID 137911)
Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija
Došlić, Tomislav
Counting perfect matchings in n-extendable graphs // Discrete mathematics, 308 (2008), 2297-2300
Podaci o odgovornosti
Došlić, Tomislav
engleski
Counting perfect matchings in n-extendable graphs
The structural theory of matchings is used to establish lower bounds on the number of perfect matchings in n-extendable graphs. It is shown that any such graph on p vertices and q edges contains at least (n + 1)!/4[q − p − (n − 1)(2 Delta − 3) + 4] different perfect matchings, where Delta is the maximum degree of a vertex in G.
n-extendable graph; Perfect matching; Enumeration
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o izdanju
Povezanost rada
Povezane osobe
Povezane ustanove
Povezani projekti