Induced H-packing k-partition problem in certain carbon based nanostructures

被引:0
|
作者
Santiagu Theresal
Antony Xavier
S. Maria Jesu Raja
机构
[1] (Affiliated to University of Madras),Department of Mathematics, Loyola College
[2] VISTAS,School of Basic Sciences
来源
关键词
-packing; -packing; Perfect ; -packing; Perfect ; -packing; Almost Perfect ; -packing; Induced ; -packing ; -partition; Armchair carbon nanotube ; [;  ; ]; Zigzag carbon nanotube ; [;  ; ]; Zigzag polyhex carbon nanotube ; Boron triangular carbon nanotubes ;
D O I
暂无
中图分类号
学科分类号
摘要
Nanotechnology has gained recently much attention in research to develop new carbon based materials with unique properties. It generates many new materials and devices with a wide range of applications in medicine, electronics, and computer. Carbon nanotubes (CNTs) are one of the most promising resources in the field of nanotechnology. Mathematically, assembling in predictable arrays is equivalent to packing in graphs. An H-packing of a graph G is the set of vertex disjoint subgraphs of G, each of which is isomorphic to a fixed graph H. In this paper we determine perfect and almost perfect H-packing and an induced H-packing k-partition number for Armchair carbon nanotube ACNT[n, m], Zigzag carbon nanotube ZCNT[n, m], Zigzag polyhex carbon nanotube TUHC6[2m,n]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$TUHC_{6}[2m,n]$$\end{document}, Boron triangular carbon nanotubes BNTt[n,m]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$BNT_{t}[n, m]$$\end{document}, TUC4C8(R)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$TUC_{4}C_{8}(R)$$\end{document}, TUC4C8(S)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$TUC_{4}C_{8}(S)$$\end{document}, HAC5C6C7[n,m]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$HAC_{5}C_{6}C_{7} [n, m]$$\end{document} and HAC5C7[n,m]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$HAC_{5}C_{7}[n, m]$$\end{document} with H isomorphic to P3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P_{3}$$\end{document}. Further we investicate C4\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_{4}$$\end{document}-packing for TUC4C8(R)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$TUC_{4}C_{8}(R)$$\end{document}.
引用
收藏
页码:1429 / 1449
页数:20
相关论文
共 50 条
  • [1] Induced H-packing k-partition problem in certain carbon based nanostructures
    Theresal, Santiagu
    Xavier, Antony
    Raja, S. Maria Jesu
    [J]. JOURNAL OF MATHEMATICAL CHEMISTRY, 2021, 59 (06) : 1429 - 1449
  • [2] Induced H-packing k-partition of graphs
    Raja, S. Maria Jesu
    Rajasingh, Indra
    Xavier, Antony
    [J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS- COMPUTER SYSTEMS THEORY, 2021, 6 (02) : 143 - 158
  • [3] Induced H-packing k-partition number for certain nanotubes and chemical graphs
    Xavier, Antony
    Theresal, Santiagu
    Raja, S. Maria Jesu
    [J]. JOURNAL OF MATHEMATICAL CHEMISTRY, 2020, 58 (06) : 1177 - 1196
  • [4] Induced H-packing k-partition number for certain nanotubes and chemical graphs
    Antony Xavier
    Santiagu Theresal
    S. Maria Jesu Raja
    [J]. Journal of Mathematical Chemistry, 2020, 58 : 1177 - 1196
  • [5] Projection results for the k-partition problem
    Fairbrother, Jamie
    Letchford, Adam N.
    [J]. DISCRETE OPTIMIZATION, 2017, 26 : 97 - 111
  • [6] Exploiting sparsity for the min k-partition problem
    Guanglei Wang
    Hassan Hijazi
    [J]. Mathematical Programming Computation, 2020, 12 : 109 - 130
  • [7] Exploiting sparsity for the min k-partition problem
    Wang, Guanglei
    Hijazi, Hassan
    [J]. MATHEMATICAL PROGRAMMING COMPUTATION, 2020, 12 (01) : 109 - 130
  • [8] Efficient algorithms for some k-partition problem of graphs
    Takaki, A
    Wada, K
    Kawaguchi, K
    [J]. ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 1997, 80 (07): : 74 - 84
  • [9] A Level Set Method for the Dirichlet k-Partition Problem
    Kwunlun Chu
    Shingyu Leung
    [J]. Journal of Scientific Computing, 2021, 86
  • [10] A Level Set Method for the Dirichlet k-Partition Problem
    Chu, Kwunlun
    Leung, Shingyu
    [J]. JOURNAL OF SCIENTIFIC COMPUTING, 2021, 86 (01)