Scholarlink

Graph labeling is one of the most interesting concepts in graph theory which has a numerous application in different fields. A labeling of graph is the allocation of labels, conventionally reserved as integers, to edges and/or nodes of a graph. Sum divisor cordial labeling is a new variant of divisor cordial labeling. In the present investigations we have derived six new out-turns admitting SDCL for middle graph of path, cycle and star, total graph of path, cycle and star graph.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Sum Divisor Cordial Labeling for Middle Graph and Total Graph of Some Graphs

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Divya G. Adalja

摘要

Graph labeling is one of the most interesting concepts in graph theory which has a numerous application in different fields. A labeling of graph is the allocation of labels, conventionally reserved as integers, to edges and/or nodes of a graph. Sum divisor cordial labeling is a new variant of divisor cordial labeling. In the present investigations we have derived six new out-turns admitting SDCL for middle graph of path, cycle and star, total graph of path, cycle and star graph.