Average covering number for some graphs

DOI10.1051/RO/2018044zbMATH Open1442.68166OpenAlexW2807046588WikidataQ129799361 ScholiaQ129799361MaRDI QIDQ5380979FDOQ5380979

Authors: Derya Doǧan Durgun, Ali Bagatarhan 

Publication date: 7 June 2019

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2018044

Recommendations

• The average covering number of a graph
• scientific article; zbMATH DE number 1092952
• On the vertex \(k\)-path cover
• On the characteristic polynomials of covering number of vertices and edges of graphs
• Random graph coverings. I: General theory and graph connectivity

zbMATH Keywords

graph theorygraph operationsaverage covering numbers

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Cited In (1)

• The average covering number of a graph

This page was built for publication: Average covering number for some graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380979)