Friendship Two-Graphs in Route Mapping Technology

The aim of the paper is extending friendship graphs to two-graphs, a two-graph being an ordered pair, ), every unordered pair of distinct vertices u, v is connected by a unique bicolored 2-path in route mapping. Construct an infinite such graph and this construction can be extended to an infinite (uncountable) family. Also finding a finite friendship two-graph, conjecture that is unique and proved this conjecture for the two-graphs that have a dominating vertex in route mapping.