Line 1 declares your graph, called g, and its type (a digraph).
第一行声明这个图为g,并且声明了该图的类型(digraph)。
Using it the directed tree polynomial of a directed graph G can be found conveniently and efficiently.
应用它可以方便且有效地求出一个有向图G的有向树多项式。
In this paper, we mainly study consecution of consecutive graph under several operations. also we determine bounds of irregularity strength and (g) for there classes of graphs.
本文讨论连续的图在几种图运算下的连续性,证明了几类特殊图是连续的,并得到它们的非正则和以及非正则强度的界。
应用推荐