In this paper we give a lower bound for the edge function domination numbers of graphs. As a special case, we prove that γ s ′( G)≥ 0 for any regular graph G, and show that the two results in are not true

  • 给出了图的边函数控制数的一个下界.特殊地,证明了n阶正则图的边函数控制数γs′(G)≥0,同时也指出了文〔1〕中两个定理的错误

  • 互联网摘选 2025-01-20 12:43:53

    • 相关例句
    精确
    • 模糊
    • 词首
    • 词尾
    • 词义
    • 例句