Results 1  10
of
219
Investigating the existence and the regularity of logarithmic harary graphs
 IN TECHNICALREPORT 1/08 MIDLAB  DIPARTIMENTO DI INFORMATICA E SISTEMISTICA, UNIVERSITÀ DI ROMA “LA SAPIENZA”. HTTP://WWW.DIS.UNIROMA1.IT/ MIDLAB/PUBLICATIONS
, 2008
"... This paper studies the existence and the regularity of Logarithmic Harary Graphs (LHGs). This study is motivated by the fact that these graphs are employed for modeling the communication topology to support efficient flooding in presence of link and node failures when considering an initial arbitrar ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper studies the existence and the regularity of Logarithmic Harary Graphs (LHGs). This study is motivated by the fact that these graphs are employed for modeling the communication topology to support efficient flooding in presence of link and node failures when considering an initial
Covering Regular Graphs
, 1997
"... A covering projection from a graph G onto a graph H is a "local isomorphism": a mapping from the vertex set of G onto the vertex set of H such that, for every v 2 V (G), the neighborhood of v is mapped bijectively onto the neighborhood (in H) of the image of v. We investigate two concep ..."
Abstract

Cited by 22 (5 self)
 Add to MetaCart
concepts that concern graph covers of regular graphs. The first one is called "multicovers": we show that for any regular graph H there exists a graph G that allows many different covering projections onto H . Secondly, we consider partial covers, which require only that G be a subgraph of a
Classification of regular twographs on 36 . . .
"... In a previous paper an incomplete investigation into regular twographs on 36 vertices established the existence of at least 227. Using a more efficient algorithm, the two authors have independently verified that in fact these 227 comprise the complete set. An immediate consequence of this is that a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In a previous paper an incomplete investigation into regular twographs on 36 vertices established the existence of at least 227. Using a more efficient algorithm, the two authors have independently verified that in fact these 227 comprise the complete set. An immediate consequence
ZeroSum Flows in Regular Graphs
"... For an undirected graph G, a zerosum flow is an assignment of nonzero real numbers to the edges, such that the sum of the values of all edges incident with each vertex is zero. It has been conjectured that if a graph G has a zerosum flow, then it has a zerosum 6flow. We prove this conjecture an ..."
Abstract
 Add to MetaCart
)2flow. Finally, the existence of kflows for small graphs is investigated. ∗Keywords: regular graph, bidirected graph, zerosum flow.
Perfect Matchings via Uniform Sampling in Regular Bipartite Graphs
"... In this paper we further investigate the wellstudied problem of finding a perfect matching in a regular bipartite graph. The first nontrivial algorithm, with running time O(mn), dates back to König’s work in 1916 (here m = nd is the number of edges in the graph, 2n is the number of vertices, and d ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
In this paper we further investigate the wellstudied problem of finding a perfect matching in a regular bipartite graph. The first nontrivial algorithm, with running time O(mn), dates back to König’s work in 1916 (here m = nd is the number of edges in the graph, 2n is the number of vertices
Mathematical Foundations of Regular Quantum Graphs
, 2002
"... We define a class of quantum systems called regular quantum graphs. Although their dynamics is chaotic in the classical limit with positive topological entropy, the spectrum of regular quantum graphs is explicitly computable analytically and exactly, state by state, by means of periodic orbit expans ..."
Abstract
 Add to MetaCart
We define a class of quantum systems called regular quantum graphs. Although their dynamics is chaotic in the classical limit with positive topological entropy, the spectrum of regular quantum graphs is explicitly computable analytically and exactly, state by state, by means of periodic orbit
Classification of regular twographs on 36 and 38 vertices
, 2001
"... In a previous paper an incomplete investigation into regular twographs on 36 vertices established the existence of at least 227. Using a more efficient algorithm, the two authors have independently verified that in fact these 227 comprise the complete set. An immediate consequence of this is that a ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
In a previous paper an incomplete investigation into regular twographs on 36 vertices established the existence of at least 227. Using a more efficient algorithm, the two authors have independently verified that in fact these 227 comprise the complete set. An immediate consequence
EXISTENCE AND REGULARITY OF MONOTONE SOLUTIONS TO A FREE BOUNDARY PROBLEM
, 2007
"... We investigate existence and regularity properties of onephase free boundary graphs, in connection with the question of whether there exists a complete nonplanar free boundary graph in high dimensions. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We investigate existence and regularity properties of onephase free boundary graphs, in connection with the question of whether there exists a complete nonplanar free boundary graph in high dimensions.
Rank of Adjacency Matrices of Directed (Strongly) Regular Graphs
"... For a positive integer r we consider the set Br of all values of k n for which there exists an n ×n matrix with entries 0 and 1 such that each row and each column has exactly k 1’s and the matrix has rank r. We prove that the set Br is finite, for every r. If there exists a kregular directed graph ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
on n vertices such that its adjacency matrix has rank r then k n ∈ Br. We use this to exclude existence of directed strongly regular graphs for infinitely many feasible parameter sets. The investigation of {0, 1} matrices of low rank in this paper is motivated by the study of directed strongly regular
Hminimal graphs of low regularity in H 1
 Comment. Math. Helv
, 2006
"... ABSTRACT. In this paper we investigate Hminimal graphs of lower regularity. We show that noncharactersitic C 1 Hminimal graphs are ruled surfaces with C 2 seed curves. Moreover, in light of a structure theorem of Franchi, Serapioni and Serra Cassano, we see that any Hminimal surface is, up to a s ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
ABSTRACT. In this paper we investigate Hminimal graphs of lower regularity. We show that noncharactersitic C 1 Hminimal graphs are ruled surfaces with C 2 seed curves. Moreover, in light of a structure theorem of Franchi, Serapioni and Serra Cassano, we see that any Hminimal surface is, up to a
Results 1  10
of
219