For a bipartite graph G with partite sets V_1 and V_2, define(When G is a complete bipartite graph, we defineσ_(1,1)=∞).
定义(若G是一个完全二部图，则令σ_(1.1)=∞)。
参考来源 - 图中独立4A graph is claw-free if it contains no induced subgraph isomorphic to K_(1,3), where K_(1,3) is a complete bipartite graph.
如果G中不含有与K_(1，3)同构的导出子图，则称G为无爪图。 这里K_(1，3)是完全二部图。
参考来源 - 无爪图的Hamilton连通性及其应用·2,447,543篇论文数据，部分数据来源于NoteExpress
本文确定了所有的轮图和完全二部图的符号星控制数。
The(d, 1)-total labelling numbers of the fan and wheel graphs were presented.
大多的努力是在探求完全图，完全二部图及笛卡尔积图的交叉数。
Much effort has been spent on investigating the crossing Numbers of complete graphs, complete bipartite graphs and cartesian products graphs.
本文对几类特殊图的强符号控制函数及强符号控制数进行了研究，给出了完全图、完全二部图、路及圈的强符号控制数。
With the definition of the strong signed domination function and the strong signed domination number of a graph, some lower bounds of the strong signed domination number about graph are obtained.
应用推荐