Results 1  10
of
584,264
Abstract Cover Contact Graphs
"... We study properties of the cover contact graphs (CCG). These graphs are defined by a pair G = (S, C), where S is a set of objects (called seeds) in the plane, and C is a collection of discs or triangles (called covers) covering the seeds, with the property that the interior of those discs are mutual ..."
Abstract
 Add to MetaCart
We study properties of the cover contact graphs (CCG). These graphs are defined by a pair G = (S, C), where S is a set of objects (called seeds) in the plane, and C is a collection of discs or triangles (called covers) covering the seeds, with the property that the interior of those discs
Homological coverings of graphs
 Journal of London Mathematical Society II
, 1984
"... The homology group of a graph, with any coefficient ring, can be used to construct covering graphs. The properties of the covering graphs are studied, and it, is proved that they admit groups of automorphisms related to the group of the base graph. In the case of cubic graphs the construction throws ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
The homology group of a graph, with any coefficient ring, can be used to construct covering graphs. The properties of the covering graphs are studied, and it, is proved that they admit groups of automorphisms related to the group of the base graph. In the case of cubic graphs the construction
Branched coverings of graph imbeddings
"... This announcement outlines a reformulation of W. Gustin's combinatorial theory of current graphs [3] and J. W. T. Youngs ' extension of that theory to vortex graphs [8] into the topological context of covering spaces and branched covering spaces. Whereas certain restrictions imposed by Gus ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This announcement outlines a reformulation of W. Gustin's combinatorial theory of current graphs [3] and J. W. T. Youngs ' extension of that theory to vortex graphs [8] into the topological context of covering spaces and branched covering spaces. Whereas certain restrictions imposed
ΩCOVERS OF GRAPHS
"... Given a group G, aGset Ω and a graph Γ, we present a construction for a family of graphs, the Ωcovers of Γ. A particular example of this construction gives a girth 17 cubic graph with 2530 vertices. 1. ..."
Abstract
 Add to MetaCart
Given a group G, aGset Ω and a graph Γ, we present a construction for a family of graphs, the Ωcovers of Γ. A particular example of this construction gives a girth 17 cubic graph with 2530 vertices. 1.
Path Coverings of Graphs . . .
, 1993
"... Using graph theoretic techniques, it is shown that the height characteristic of a triangular matrix A majorizes the dual sequence of the sequence of differences of maximal cardinalities of singular kpaths in the graph G(A) of A and that in the generic case the height characteristic is equal to that ..."
Abstract
 Add to MetaCart
to that dual sequence. The results on matrices are also used to prove a graph theoretic result on the duality of the sequence of differences of minimal k th norms of path coverings for a (01)weighted acyclic graph G and the sequence of differences of maximal cardinalities of kpaths in G. This result
Local Clique Covering of Graphs
"... A k−clique covering of a simple graph G, is an edge covering of G by its cliques such that each vertex is contained in at most k cliques. The smallest k for which G admits a k−clique covering is called local clique cover number of G and is denoted by lcc(G). Local clique cover number can be viewed a ..."
Abstract
 Add to MetaCart
A k−clique covering of a simple graph G, is an edge covering of G by its cliques such that each vertex is contained in at most k cliques. The smallest k for which G admits a k−clique covering is called local clique cover number of G and is denoted by lcc(G). Local clique cover number can be viewed
Bisimulation and Coverings for Graphs and Hypergraphs
"... We survey notions of bisimulation and of bisimilar coverings both in the world of graphlike structures (Kripke structures, transition systems) and in the world of hypergraphlike general relational structures. The provision of finite analogues for full infinite treelike unfoldings, in particular ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We survey notions of bisimulation and of bisimilar coverings both in the world of graphlike structures (Kripke structures, transition systems) and in the world of hypergraphlike general relational structures. The provision of finite analogues for full infinite treelike unfoldings
Regular clique covers of graphs
"... A family of cliques in a graph G is said to be pregular if any two cliques in the family intersect in exactly p vertices. A graph G is said to have a pregular kclique cover if there is a pregular family H of kcliques of G such that each edge of G belongs to a clique in H. Such a pregular kcli ..."
Abstract
 Add to MetaCart
A family of cliques in a graph G is said to be pregular if any two cliques in the family intersect in exactly p vertices. A graph G is said to have a pregular kclique cover if there is a pregular family H of kcliques of G such that each edge of G belongs to a clique in H. Such a pregular k
ON 2FOLD COVERS OF GRAPHS
, 2007
"... A regular covering projection ℘: ˜ X → X of connected graphs is Gadmissible if G lifts along ℘. Denote by ˜ G the lifted group, and let CT(℘) be the group of covering transformations. The projection is called Gsplit whenever the extension CT(℘) → ˜G → G splits. In this paper, split 2covers are c ..."
Abstract
 Add to MetaCart
A regular covering projection ℘: ˜ X → X of connected graphs is Gadmissible if G lifts along ℘. Denote by ˜ G the lifted group, and let CT(℘) be the group of covering transformations. The projection is called Gsplit whenever the extension CT(℘) → ˜G → G splits. In this paper, split 2covers
Edge Geodetic Covers in Graphs
"... In this paper, we characterize all connected graphs G of order n for which the edge geodetic number is n or n − 1. Edge geodetic covers in the join and composition of two graphs are also investigated and bounds or exact values of the edge geodetic numbers of the resulting graphs are determined. ..."
Abstract
 Add to MetaCart
In this paper, we characterize all connected graphs G of order n for which the edge geodetic number is n or n − 1. Edge geodetic covers in the join and composition of two graphs are also investigated and bounds or exact values of the edge geodetic numbers of the resulting graphs are determined.
Results 1  10
of
584,264