New large graphs with given degree and diameter six

J. Gómez; Ignacio M. Pelayo; C. Balbuena

doi:10.1002/(sici)1097-0037(199909)34:2<154::aid-net8>3.3.co;2-z

ScienceGate Book Chapters

JOURNAL ARTICLE

New large graphs with given degree and diameter six

J. Gómez Ignacio M. Pelayo C. Balbuena

Year: 1999 Journal: Networks Vol: 34 (2)Pages: 154-161 Publisher: Wiley

DOI: 10.1002/(sici)1097-0037(199909)34:2<154::aid-net8>3.3.co;2-z

Get Full-Text PDF Get Analytical Report

Abstract

In this paper, a method for obtaining large diameter 6 graphs by replacing some vertices of a Moore bipartite diameter 6 graph with complete Kh graphs is proposed. These complete graphs are joined to each other and to the remaining nonmodified graphs by means of new edges and by using a special diameter 2 graph. The degree of the graph so constructed coincides with the original one. © 1999 John Wiley & Sons, Inc. Networks 34: 154–161, 1999

Keywords:

Combinatorics Bipartite graph Mathematics Degree (music) 1-planar graph Cograph Graph Pathwidth Split graph Pancyclic graph Indifference graph Discrete mathematics Line graph Physics

Metrics

Cited By

0.80

FWCI (Field Weighted Citation Impact)

Refs

0.80

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Interconnection Networks and Systems

Physical Sciences → Computer Science → Computer Networks and Communications

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

New large graphs with given degree and diameter six

Abstract

Metrics

Citation History

Topics

Related Documents

Some large graphs with given degree and diameter

Large Graphs with Given Degree and Diameter III

Large bipartite graphs with given degree and diameter

Large graphs with given degree and diameter. II

Large planar graphs with given diameter and maximum degree