Open Access Open Access  Restricted Access Subscription or Fee Access

The Distributed Algorithm for Constructing Extremal Graphs without Hexagon

Rui Zhang, Yongqi Sun, Nan Zhao


MapReduce is a common model for processing large dataset by which the programming for distributed computing can be easier. The extremal graph is a graph with the maximum size and not containing some given subgraphs. In this paper, the distributed algorithm based on MapReduce for constructing extremal graphs is designed and implemented. Employing this algorithm, the extremal graphs not containing hexagon are constructed, which shows that the graph of order 28 and size at least 71 must contain a hexagon. Moreover, the experimental results show that average efficiency of the algorithm is 75.48%.


distributed computing, MapReduce, Hadoop, extremal graph.

Full Text:



  • There are currently no refbacks.

Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.