Minimum Clique-clique Dominating Laplacian Energy of a Graph

被引：0
|
作者：
Department of Mathematics, Manipal Institute of Technology, Manipal Academy of Higher Education, Manipal [1 ]
Karnataka
576104, India
机构：
来源：
IAENG Int. J. Comput. Sci. | / 4卷 / 1-5期
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Laplace transforms
引用
收藏
相关论文
共 50 条
  • [41] Clique complexes and graph powers
    Michał Adamaszek
    Israel Journal of Mathematics, 2013, 196 : 295 - 319
  • [42] Bounds for graph energy in terms of vertex covering and clique numbers
    Ganie, Hilal A.
    Samee, U.
    Pirzada, S.
    Alghamdi, Ahmad M.
    ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2019, 7 (02) : 315 - 328
  • [43] Exact Algorithms for Dominating Clique Problems (Extended Abstract)
    Bourgeois, N.
    Della Croce, F.
    Escoffier, B.
    Paschos, V. Th
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 4 - +
  • [44] MINIMUM AVERAGE DISTANCE CLIQUE TREES
    Xu, Shou-Jun
    Gysel, Rob
    Gusfield, Dan
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2015, 29 (03) : 1706 - 1734
  • [45] Circumference, minimum degree and clique number
    Yuan, Long-Tu
    ELECTRONIC JOURNAL OF COMBINATORICS, 2024, 31 (04):
  • [46] Minimum Vertex Blocker Clique Problem
    Pajouh, Foad Mahdavi
    Boginski, Vladimir
    Pasiliao, Eduardo L.
    NETWORKS, 2014, 64 (01) : 48 - 64
  • [47] The Distance Laplacian Spectral Radius of Clique Trees
    Zhang, Xiaoling
    Zhou, Jiajia
    DISCRETE DYNAMICS IN NATURE AND SOCIETY, 2020, 2020
  • [48] The Minimum Clique Routing Problem on Cycles
    Escalante, Mariana
    Tolomei, Paola
    Matamala, Martín
    Rapaport, Iván
    Torres, Luis Miguel
    arXiv, 2023,
  • [49] Minimum dominating maximum degree energy of a graph
    Jagadeesh R.
    Kanna M.R.R.
    Mamta D.
    Kumar R.P.
    Journal of Computational and Theoretical Nanoscience, 2016, 13 (05) : 2850 - 2855
  • [50] MINIMUM ROMAN DOMINATING DISTANCE ENERGY OF A GRAPH
    Lakshmanan, R.
    Annamalai, N.
    JOURNAL OF THE INDONESIAN MATHEMATICAL SOCIETY, 2023, 29 (03) : 338 - 346
12345