Graphs of order two less than the Moore bound
- Authors: Miller, Mirka , Simanjuntak, Rinovia
- Date: 2008
- Type: Text , Journal article
- Relation: Discrete Mathematics Vol. 308, no. 13 (2008), p. 2810-2821
- Full Text: false
- Reviewed:
- Description: The Moore bound for a directed graph of maximum out-degree d and diameter k is Md,k=1+d+d2++dk. It is known that digraphs of order Md,k (Moore digraphs) do not exist for d>1 and k>1. Similarly, the Moore bound for an undirected graph of maximum degree d and diameter k is . Undirected Moore graphs only exist in a small number of cases. Mixed (or partially directed) Moore graphs generalize both undirected and directed Moore graphs. In this paper, we shall show that all known mixed Moore graphs of diameter k=2 are unique and that mixed Moore graphs of diameter k3 do not exist.
- Description: C1
On graphs with cyclic defect or excess
- Authors: Delorme, Charles , Pineda-Villavicencio, Guillermo
- Date: 2010
- Type: Text , Journal article
- Relation: Electronic Journal of Combinatorics Vol. 17, no. 1 (2010), p.
- Full Text:
- Reviewed:
- Description: The Moore bound constitutes both an upper bound on the order of a graph of maximum degree d and diameter D = k and a lower bound on the order of a graph of minimum degree d and odd girth g = 2k + 1. Graphs missing or exceeding the Moore bound by ε are called graphs with defect or excess ε, respectively. While Moore graphs (graphs with ε = 0) and graphs with defect or excess 1 have been characterized almost completely, graphs with defect or excess 2 represent a wide unexplored area. Graphs with defect (excess) 2 satisfy the equation Gd,k(A) = Jn +B (Gd,k(A) = Jn - B), where A denotes the adjacency matrix of the graph in question, n its order, Jn the n × n matrix whose entries are all 1's, B the adjacency matrix of a union of vertex-disjoint cycles, and Gd,k(x) a polynomial with integer coefficients such that the matrix Gd,k(A) gives the number of paths of length at most k joining each pair of vertices in the graph. In particular, if B is the adjacency matrix of a cycle of order n we call the corresponding graphs graphs with cyclic defect or excess; these graphs are the subject of our attention in this paper. We prove the non-existence of infinitely many such graphs. As the highlight of the paper we provide the asymptotic upper bound of O(64/3 d3/2) for the number of graphs of odd degree d ≥ 3 and cyclic defect or excess. This bound is in fact quite generous, and as a way of illustration, we show the non-existence of some families of graphs of odd degree d ≥ 3 and cyclic defect or excess. Actually, we conjecture that, apart from the Möbius ladder on 8 vertices, no non-trivial graph of any degree ≥ 3 and cyclic defect or excess exists.
Complete characterization of almost moore digraphs of degree three
- Authors: Baskoro, Edy , Miller, Mirka , Siran, Jozef , Sutton, Martin
- Date: 2005
- Type: Text , Journal article
- Relation: Journal of Graph Theory Vol. 48, no. 2 (2005), p. 112-126
- Full Text: false
- Reviewed:
- Description: It is well known that Moore digraphs do not exist except for trivial cases (degree 1 or diameter 1), but there are digraphs of diameter two and arbitrary degree which miss the Moore bound by one. No examples of such digraphs of diameter at least three are known, although several necessary conditions for their existence have been obtained. In this paper, we prove that digraphs of degree three and diameter k ≥ 3 which miss the Moore bound by one do not exist. © 2004 Wiley Periodicals, Inc.
- Description: C1
- Description: 2003000904
Structural properties of graphs of diameter 2 with maximal repeats
- Authors: Nguyen, Minh Hoang , Miller, Mirka
- Date: 2008
- Type: Text , Journal article
- Relation: Discrete Mathematics Vol. 308, no. 11 (Jun 2008), p. 2337-2341
- Full Text: false
- Reviewed:
- Description: It was shown using eigenvalue analysis by Erdos et al. that with the exception of C-4, there are no graphs of diameter 2, of maximum degree d and of order d(2), that is, one less than the Moore bound. These graphs belong to a class of regular graphs of diameter 2, and having certain interesting structural properties, which will be proved in this paper. (c) 2007 Elsevier B.V. All rights reserved.
- Description: C1
Complete catalogue of graphs of maximum degree 3 and defect at most 4
- Authors: Miller, Mirka , Pineda-Villavicencio, Guillermo
- Date: 2009
- Type: Text , Journal article
- Relation: Discrete Applied Mathematics Vol. 157, no. 13 (2009), p. 2983-2996
- Full Text:
- Reviewed:
- Description: We consider graphs of maximum degree 3, diameter D≥2 and at most 4 vertices less than the Moore bound M3,D, that is, (3,D,−)-graphs for ≤4. We prove the non-existence of (3,D,−4)-graphs for D≥5, completing in this way the catalogue of (3,D,−)-graphs with D≥2 and ≤4. Our results also give an improvement to the upper bound on the largest possible number N3,D of vertices in a graph of maximum degree 3 and diameter D, so that N3,D≤M3,D−6 for D≥5. Copyright Elsevier.
On mixed Moore graphs
- Authors: Nguyen, Minh Hoang , Miller, Mirka , Gimbert, Joan
- Date: 2007
- Type: Text , Journal article
- Relation: Discrete Mathematics Vol. 307, no. 7-8 (2007), p. 964-970
- Full Text: false
- Reviewed:
- Description: The Moore bound for a directed graph of maximum out-degree d and diameter k is M
- Description: C1
- Description: 2003005024
Hybrid simulated annealing and genetic algorithm for degree/diameter problem
- Authors: Tang, Jianmin , Miller, Mirka , Lin, Yuqing
- Date: 2005
- Type: Text , Conference paper
- Relation: Paper pesented at Sixteenth Australasian Workshop on Combinatorial Algorithms, AWOCA 2005, Ballarat, Victoria : 18th-21st September 2005 p. 321-331
- Full Text: false
- Description: The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree and given diameter. This paper deals with directed graphs. General upper bounds, called Moore bounds, exist for the largest possible order of such digraphs of maximum degree d and diameter k. It is known that simulated annealing and genetic algorithm are effective techniques to identify global optimization solutions. This paper describes our attempt to build a Hybrid Simulated Annealing and Genetic Algorithm (HSAGA) that can be used to construct larger digraphs, and displays our preliminary results obtained by HSAGA.
- Description: 2003001438
HSAGA and its application for the construction of near-Moore digraphs
- Authors: Tang, Jianmin , Miller, Mirka , Lin, Yuqing
- Date: 2008
- Type: Text , Journal article
- Relation: Journal of Discrete Algorithms Vol. 6, no. 1 (2008), p. 73-84
- Full Text: false
- Reviewed:
- Description: The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree and given diameter. This paper deals with directed graphs. General upper bounds, called Moore bounds, exist for the largest possible order of such digraphs of maximum degree d and given diameter k. It is known that simulated annealing and genetic algorithm are effective techniques to identify global optimal solutions. This paper describes our attempt to build a Hybrid Simulated Annealing and Genetic Algorithm (HSAGA) that can be used to construct large digraphs. We present our new results obtained by HSAGA, as well as several related open problems. © 2007 Elsevier B.V. All rights reserved.
- Description: C1
On graphs of defect at most 2
- Authors: Feria-Purón, Ramiro , Miller, Mirka , Pineda-Villavicencio, Guillermo
- Date: 2011
- Type: Text , Journal article
- Relation: Discrete Applied Mathematics Vol. 159, no. 13 (2011), p. 1331-1344
- Full Text:
- Reviewed:
- Description: In this paper we consider the degree/diameter problem, namely, given natural numbers Δ<2 and D<1, find the maximum number N(Δ,D) of vertices in a graph of maximum degree Δ and diameter D. In this context, the Moore bound M(Δ,D) represents an upper bound for N(Δ,D). Graphs of maximum degree Δ, diameter D and order M(Δ,D), called Moore graphs, have turned out to be very rare. Therefore, it is very interesting to investigate graphs of maximum degree Δ<2, diameter D<1 and order M(Δ,D)- with small >0, that is, (Δ,D,-)-graphs. The parameter is called the defect. Graphs of defect 1 exist only for Δ=2. When >1, (Δ,D,-)-graphs represent a wide unexplored area. This paper focuses on graphs of defect 2. Building on the approaches developed in Feria-Purón and Pineda-Villavicencio (2010) [11] we obtain several new important results on this family of graphs. First, we prove that the girth of a (Δ,D,-2)-graph with Δ<4 and D<4 is 2D. Second, and most important, we prove the non-existence of (Δ,D,-2)-graphs with even Δ<4 and D<4; this outcome, together with a proof on the non-existence of (4,3,-2)-graphs (also provided in the paper), allows us to complete the catalogue of (4,D,-)-graphs with D<2 and 0≤≤2. Such a catalogue is only the second census of (Δ,D,-2)-graphs known at present, the first being that of (3,D,-)-graphs with D<2 and 0≤≤2 Jørgensen (1992) [14]. Other results of this paper include necessary conditions for the existence of (Δ,D,-2)-graphs with odd Δ<5 and D<4, and the non-existence of (Δ,D,-2)-graphs with odd Δ<5 and D<5 such that Δ≡0,2(modD). Finally, we conjecture that there are no (Δ,D,-2)-graphs with Δ<4 and D<4, and comment on some implications of our results for the upper bounds of N(Δ,D). © 2011 Elsevier B.V. All rights reserved.
New benchmarks for large-scale networks with given maximum degree and diameter
- Authors: Loz, Eyal , Pineda-Villavicencio, Guillermo
- Date: 2010
- Type: Text , Journal article
- Relation: Computer Journal Vol. 53, no. 7 (2010), p. 1092-1105
- Full Text: false
- Reviewed:
- Description: Large-scale networks have become ubiquitous elements of our society. Modern social networks, supported by communication and travel technology, have grown in size and complexity to unprecedented scales. Computer networks, such as the Internet, have a fundamental impact on commerce, politics and culture. The study of networks is also central in biology, chemistry and other natural sciences. Unifying aspects of these networks are a small maximum degree and a small diameter, which are also shared by many network models, such as small-world networks. Graph theoretical methodologies can be instrumental in the challenging task of predicting, constructing and studying the properties of large-scale networks. This task is now necessitated by the vulnerability of large networks to phenomena such as cross-continental spread of disease and botnets (networks of malware). In this article, we produce the new largest known networks of maximum degree 17 ≤ ∆ ≤ 20 and diameter 2 ≤ D ≤ 10, using a wide range of techniques and concepts, such as graph compounding, vertex duplication, Kronecker product, polarity graphs and voltage graphs. In this way, we provide new benchmarks for networks with given maximum degree and diameter, and a complete overview of state-of-the-art methodology that can be used to construct such networks.