izvor podataka: crosbi
✓
Saturation Number of Benzenoid Graphs (CROSBI ID 214245)
Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija
Došlić, Tomislav ; Zubac, Ivana
Saturation Number of Benzenoid Graphs // MATCH : communications in mathematical and in computer chemistry, 73 (2015), 491-500
Podaci o odgovornosti
Došlić, Tomislav ; Zubac, Ivana
engleski
Saturation Number of Benzenoid Graphs
The saturation number of a graph is the cardinality of any smallest maximal matching in the graph. We present explicit results and tight asymptotic bounds on the saturation number of several classes of benzenoid graphs.
saturation number ; benzenoid graph
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o izdanju
73
2015.
491-500
objavljeno
0340-6253
Povezanost rada
Povezane osobe
Povezane ustanove
Povezani projekti