User Settings
Article

Diameter and Mean Distance of Bipartite Digraphs Related to Plane Tessellations

Francesc Comellas,Chilton Didcot England,Paulina Morillo,M.A. Fiol-1990-01-01
0

TL;DRAbstract

It is possible to associate plane tessellations with certain digraphs over the set of vertices V = Z=nZ. This association enables a geometrical, and in general simpler, approach to their study. We use this relation for obtaining the maximum order, minimum diameter and minimum mean distance of a family of bipartite digraphs of degree two. The results found improve those known for similar families of digraphs with the same degree.

Chat with Paper

AI Agents for this Paper

It is possible to associate plane tessellations with certain digraphs over the set of vertices V = Z=nZ. This association enables a geometrical, and in general simpler, approach to their study. We use this relation for obtaining the maximum order, minimum diameter and minimum mean distance of a family of bipartite digraphs of degree two. The results found improve those known for similar families of digraphs with the same degree.

Keywords

CombinatoricsBipartite graphMathematicsDegree (music)Plane (geometry)DigraphSet (abstract data type)Order (exchange)

Chat

Click to start Chat