ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Friendship Two-Graphs in Route Mapping Technology

Journal: International Journal of Scientific Engineering and Research (IJSER) (Vol.2, No. 9)

Publication Date:

Authors : ; ; ;

Page : 29-32

Keywords : -friendship graphs; windmill graph; simple node; complex node; Kotzig generalized friendship graphs;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

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.

Last modified: 2021-07-08 15:15:07