搜索结果: 1-5 共查到“数学 girth”相关记录5条 . 查询时间(0.046 秒)
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Check (LDPC) codes. ...
Recently, it has been shown that a connected graph $\Gamma$ with $d+1$ distinct eigenvalues and odd-girth $2d+1$ is distance-regular. The proof of this result was based on the spectral excess theorem....
Extremal results regarding $K_6$-minors in graphs of girth at least 5
Extremal results regarding $K_6$-minors graphs of girth
2011/2/28
We prove that every 6-connected graph of girth ≥ 6 has a K6-minor and thus settle Jorgensen’s
conjecture for graphs of girth ≥ 6. Relaxing the assumption on the girth, we prove that every
6-connecte...
Minimizing Laplacian spectral radius of unicyclic graphs with fixed girth
Laplacian matrix Laplacian spectral radius girth unicyclic graph
2011/1/18
In this paper we consider the following problem: Over the class of all simple con-nected unicyclic graphs on n vertices with girth g (n, g being fixed), which graph minimizes the Laplacian spectral ra...
We present a generalization of the construction of graphs by Lubotzky, Phillips and Sarnak in their celebrated article "Ramanujan graphs". The new approach consists in using octonion algebras rather ...