ON ORTHOGONAL (0,f)-FACTORIZATIONS

被引:2
|
作者
冯好娣
机构
关键词
Graph; factor; orthogonal factorization;
D O I
暂无
中图分类号
O156 [数论];
学科分类号
0701 ; 070101 ;
摘要
Let G be a graph and f an integer-valued function defined on V(G). It is proved that every (0, mf-m +1)-graph G has a (0, f)-factorization orthogonal to any given subgraph with,m edges.
引用
收藏
页码:332 / 336
页数:5
相关论文
共 50 条
  • [41] Randomly orthogonal factorizations in networks
    Zhou, Sizhong
    Xu, Lan
    Xu, Yang
    CHAOS SOLITONS & FRACTALS, 2016, 93 : 187 - 193
  • [42] Matrix factorizations and orthogonal polynomials
    Dominici, Diego
    RANDOM MATRICES-THEORY AND APPLICATIONS, 2020, 9 (01)
  • [43] Discussions on Orthogonal Factorizations in Digraphs
    Si-zhong Zhou
    Hong-xia Liu
    Acta Mathematicae Applicatae Sinica, English Series, 2022, 38 : 417 - 425
  • [44] Discussions on Orthogonal Factorizations in Digraphs
    Zhou, Si-zhong
    Liu, Hong-xia
    ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2022, 38 (02): : 417 - 425
  • [45] A generalization of orthogonal factorizations in graphs
    Li, GJ
    Liu, GZ
    ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2001, 17 (04): : 669 - 678
  • [46] FACTORIZATIONS, LOCALIZATIONS, AND THE ORTHOGONAL SUBCATEGORY PROBLEM
    THOLEN, W
    MATHEMATISCHE NACHRICHTEN, 1983, 114 : 63 - 85
  • [47] A new result on orthogonal factorizations in networks
    Zhou, Sizhong
    Pan, Quanru
    Xu, Yang
    FILOMAT, 2024, 38 (20) : 7235 - 7244
  • [48] Block Algorithms for Orthogonal Symplectic Factorizations
    D. Kressner
    BIT Numerical Mathematics, 2003, 43 : 775 - 790
  • [49] Block algorithms for orthogonal symplectic factorizations
    Kressner, D
    BIT NUMERICAL MATHEMATICS, 2003, 43 (04) : 775 - 790
  • [50] Rainbow and Orthogonal Paths in Factorizations of Kn
    Gyarfas, Andras
    Mhalla, Mehdi
    JOURNAL OF COMBINATORIAL DESIGNS, 2010, 18 (03) : 167 - 176