In this paper, a new type of edge color-ing of graphs together with an algorithm for such an edge coloring is presented ......

The girth plays an important role in the design of LDPC codes. In order to determine the girth of Tanner(5,7) quasi-cycl......

A graph G is said to be an (ι,d)-graph (with respect to edges) if d(G-E) ≤ d, (∨)E (C) E(G) such that ∣E∣≤ι - 1. ......

In this paper, we obtain a class of new geodetic block with given diameter and girth by subdividing Petersen graph....

对于图G,Hosoya指标和Merrifield-Simmons指标分别定义为图G中所有匹配的和及所有独立集的和.θ-图是通过剖分有公共顶点的3条平行......

In this paper, it is proved that the girth of a 4-homogeneous bipartite graph with valency greaterthan 2 is at most 12....

It is known (for example see [2]) that the maximum genus of a graph is mainly determined by the Betti deficiency of the ......