A digraph is a graph in which each edge has an orientation. A linear directed path, , is a path whose all edges have the same orientation. A linear simple graph is called directed cordial if it admits 0 - 1 labeling t...A digraph is a graph in which each edge has an orientation. A linear directed path, , is a path whose all edges have the same orientation. A linear simple graph is called directed cordial if it admits 0 - 1 labeling that satisfies certain condition. In this paper, we study the cordiality of directed paths??and their second power . Similar studies are done for ?and the join ?. We show that ,? and ?are directed cordial. Sufficient conditions are given to the join?? to be directed cordial.展开更多
基金Support byed National Natural Science Foundation of China(10201022,10971144)Natural Science Foundationof Beijing City(1102015)Fundamental Research Funds for the Universities(2011B019)
文摘A digraph is a graph in which each edge has an orientation. A linear directed path, , is a path whose all edges have the same orientation. A linear simple graph is called directed cordial if it admits 0 - 1 labeling that satisfies certain condition. In this paper, we study the cordiality of directed paths??and their second power . Similar studies are done for ?and the join ?. We show that ,? and ?are directed cordial. Sufficient conditions are given to the join?? to be directed cordial.
