izvor podataka: crosbi
✓
Saturation number of fullerene graphs (CROSBI ID 137912)
Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija
Došlić, Tomislav
Saturation number of fullerene graphs // Journal of mathematical chemistry, 43 (2008), 2; 647-657. doi: 10.1007/s10910-006-9217-3
Podaci o odgovornosti
Došlić, Tomislav
engleski
Saturation number of fullerene graphs
Saturation number of a graph G is the minimum possible size of a maximal matching in G. We establish improved upper and lower bounds on the saturation number in fullerene graphs and discuss their sharpness and quality.
saturation number; maximal matching; fullerene graph; fullerene
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o izdanju
43 (2)
2008.
647-657
objavljeno
0259-9791
10.1007/s10910-006-9217-3
Povezanost rada
Povezane osobe
Povezane ustanove
Povezani projekti
