吴建良
-
教授
博士生导师
硕士生导师
- 性别:男
- 毕业院校:山东大学
- 学历:博士研究生毕业
- 学位:理学博士学位
- 在职信息:在职
- 所在单位:数学学院
- 入职时间: 2003-03-01
- 学科:运筹学与控制论
- 办公地点:山大南路山东大学中心校区知新楼B1054
访问量:
-
[181]
吴建良.
The information transmission in community networks.
Physica A,
392,
3827,
2013.
-
[182]
吴建良.
On the sum of powers of the degrees of graphs.
Bull. Aust. Math. Soc.,
88,
353,
2013.
-
[183]
吴建良.
Erratum to “The vertex PI and Szeged indices of chain graphs”.
MATCH Commun. Math. Comput. Chem.,
70,
467,
2013.
-
[184]
吴建良.
Detecting Communities by Revised Max-flow Method in Networks.
Commun. Theor. Phys,
60,
258,
2013.
-
[185]
吴建良.
Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords.
Theoretical Computer Science,
476,
16,
2013.
-
[186]
吴建良.
Equitable vertex arboricity of graphs.
Discrete Mathematics,
313,
2696,
2013.
-
[187]
颜谨 and 吴建良.
Degree conditions for the partition of a graph into triangles and quadrilaterals .
UTILITAS MATHEMATICA,
86,
341,
2011.
-
[188]
吴建良.
A note on the total coloring of planar graphs without adjacent 4-cycles.
Discrete Mathematics,
312,
1923,
2012.
-
[189]
吴建良.
Total colorings of planar graphs without intersecting 5-cycles.
Discrete Applied Mathematics,
160,
1815,
2012.
-
[190]
颜谨 and 吴建良.
Vertex-disjoint triangles in K(1,t)-free graphs with minimum degree at least t.
Discrete Mathematics,
310,
2499,
2010.
-
[191]
吴建良.
Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles .
Discrete Mathematics,
311,
2025,
2011.
-
[192]
吴建良.
On equitable and equitable list colorings of series-parallel graphs .
Discrete Mathematics,
311,
800,
2011.
-
[193]
Leaders in communities of real-world networks.
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS,
444,
2016.
-
[194]
Reinterpretaion of the friendship paradox.
International Journal of Modern Physics C,
28,
2017.