On order and geodesic alignment of a connected bigraph

Manoj Changat

Displaying similar documents to “On order and geodesic alignment of a connected bigraph”

The hull number of an oriented graph.

Chartrand, Gary, Fink, John Frederick, Zhang, Ping (2003)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Geodetic sets in graphs

Gary Chartrand, Frank Harary, Ping Zhang (2000)

Discussiones Mathematicae Graph Theory

Similarity:

For two vertices u and v of a graph G, the closed interval I[u,v] consists of u, v, and all vertices lying in some u-v geodesic in G. If S is a set of vertices of G, then I[S] is the union of all sets I[u,v] for u, v ∈ S. If I[S] = V(G), then S is a geodetic set for G. The geodetic number g(G) is the minimum cardinality of a geodetic set. A set S of vertices in a graph G is uniform if the distance between every two distinct vertices of S is the same fixed number. A geodetic set is essential...