Works matching DE "GRAPH connectivity"


Results: 3242
    1

    Hop k-Rainbow Domination in Graphs.

    Published in:
    European Journal of Pure & Applied Mathematics, 2025, v. 18, n. 2, p. 1, doi. 10.29020/nybg.ejpam.v18i2.5973
    By:
    • Hamja, Jamil J.;
    • Sheikholeslami, Seyed Mahmoud;
    • Aniversario, Imelda S.;
    • Cabardo, Lyster Rey B.
    Publication type:
    Article
    2

    Weakly Connected Independence Number of a Graph.

    Published in:
    European Journal of Pure & Applied Mathematics, 2025, v. 18, n. 2, p. 1, doi. 10.29020/nybg.ejpam.v18i2.6117
    By:
    • Merontos, Reignver;
    • Aniversario, Imelda S.;
    • Frondoza, Michael B.;
    • Canoy Jr., Sergio R.
    Publication type:
    Article
    3

    Forcing Clique Domination in Graphs.

    Published in:
    European Journal of Pure & Applied Mathematics, 2025, v. 18, n. 2, p. 1, doi. 10.29020/nybg.ejpam.v18i2.6065
    By:
    • Armada, Cris L.;
    • Kiunisala, Edward M.;
    • Rosero, Cristopher John S.;
    • Malusay, Jeneveb T.
    Publication type:
    Article
    4

    2-Step Movability of Hop Dominating Sets in Graphs.

    Published in:
    European Journal of Pure & Applied Mathematics, 2025, v. 18, n. 2, p. 1, doi. 10.29020/nybg.ejpam.v18i2.6074
    By:
    • Estrella, Roger L.;
    • Malacas, Gina M.;
    • Canoy Jr., Sergio R.
    Publication type:
    Article
    5

    Internally-Locating Dominating Sets in Graphs.

    Published in:
    European Journal of Pure & Applied Mathematics, 2025, v. 18, n. 2, p. 1, doi. 10.29020/nybg.ejpam.v18i2.5918
    By:
    • Tropico, Irish S.;
    • Cabahug Jr., Isagani S.
    Publication type:
    Article
    6

    Weakly Connected k-Rainbow Domination in Graphs.

    Published in:
    European Journal of Pure & Applied Mathematics, 2025, v. 18, n. 2, p. 1, doi. 10.29020/nybg.ejpam.v18i2.5770
    By:
    • Hamja, Jamil J.;
    • Sheikholeslami, Seyed Mahmoud;
    • Aniversario, Imelda S.;
    • Cabardo, Lyster Rey B.
    Publication type:
    Article
    7
    8
    9
    10
    11

    HOW MANY TRIANGLES CAN A GRAPH HAVE?

    Published in:
    Bulletin of the Australian Mathematical Society, 2025, v. 111, n. 3, p. 405, doi. 10.1017/S0004972724000972
    By:
    • KITTIPASSORN, TEERADEJ;
    • POPIELARZ, KAMIL
    Publication type:
    Article
    12

    Convex Italian Domination in Graphs.

    Published in:
    Kyungpook Mathematical Journal, 2025, v. 65, n. 1, p. 149, doi. 10.5666/KMJ.2025.65.1.149
    By:
    • CANOY, SERGIO R.;
    • JAMIL, FERDINAND P.;
    • FORTOSA, RONA JANE G.
    Publication type:
    Article
    13
    14
    15
    16
    17
    18
    19
    20
    21
    22

    (G,s)-Transitive Graphs of Valency 7.

    Published in:
    Algebra Colloquium, 2016, v. 23, n. 3, p. 493, doi. 10.1142/S100538671600047X
    By:
    • Guo, Songtao;
    • Li, Yantao;
    • Hua, Xiaohui
    Publication type:
    Article
    23
    24
    25
    26
    27

    Effective and efficient attributed community search.

    Published in:
    VLDB Journal International Journal on Very Large Data Bases, 2017, v. 26, n. 6, p. 803, doi. 10.1007/s00778-017-0482-5
    By:
    • Fang, Yixiang;
    • Cheng, Reynold;
    • Chen, Yankai;
    • Luo, Siqiang;
    • Hu, Jiafeng
    Publication type:
    Article
    28
    29
    30
    31
    32
    33
    34
    35
    36
    37
    38
    39
    40

    Completeness-Resolvable Graphs.

    Published in:
    Graphs & Combinatorics, 2022, v. 38, n. 2, p. 1, doi. 10.1007/s00373-021-02447-x
    By:
    • Feng, Min;
    • Ma, Xuanlong;
    • Xu, Huiling
    Publication type:
    Article
    41
    42
    43
    44

    Note on Forcing Problem of Trees.

    Published in:
    Graphs & Combinatorics, 2022, v. 38, n. 1, p. 1, doi. 10.1007/s00373-021-02402-w
    By:
    • He, Mengya;
    • Ji, Shengjin
    Publication type:
    Article
    45
    46
    47
    48
    49
    50