CORDIAL

作品数：52被引量：22H指数：4
导出分析报告
相关领域：理学政治法律更多>>
相关作者：刘峙山陈丽娜堵根民倪臣敏卢福良更多>>
相关机构：仰恩大学呼和浩特职业学院临沂大学内蒙古师范大学更多>>
相关期刊：《常熟理工学院学报》《China's Foreign Trade》《泉州师范学院学报》《延边大学学报（自然科学版）》更多>>
相关基金：内蒙古自治区自然科学基金国家自然科学基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 期刊=Open Journal of Discrete Mathematicsx
共 条 记 录，以下是1-9
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
k-Product Cordial Labeling of Path Graphs
《Open Journal of Discrete Mathematics》2025年第1期1-29,共29页Robinson Santrin Sabibha Kruz Jeya Daisy Pon Jeyanthi Maged Zakaria Youssef 
In 2012, Ponraj et al. defined a concept of k-product cordial labeling as follows: Let f be a map from V(G)to { 0,1,⋯,k−1 }where k is an integer, 1≤k≤| V(G) |. For each edge uvassign the label f(u)f(v)(modk). f is c...
关键词：Cordial Labeling Product Cordial Labeling k-Product Cordial Labeling Path Graph 
Cordial Labeling of Corona Product of Path Graph and Second Power of Fan Graph
《Open Journal of Discrete Mathematics》2021年第2期31-42,共12页Ashraf Ibrahim Hefnawy Elrokh Shokry Ibrahim Mohamed Nada Eman Mohamed El-Sayed El-Shafey 
A graph is said to be cordial if it has 0 - 1 labeling which satisfies particular conditions. In this paper, we construct the corona between paths a...
关键词：CORONA Second Power of Fan Cordial Graph 
Some Results on Cordial Digraphs
《Open Journal of Discrete Mathematics》2020年第1期4-12,共9页Mohammed M. Ali Al-Shamiri Shokry I. Nada Ashraf I. Elrokh Yasser Elmshtaye 
A digraph is a graph in which each edge has an orientation. A linear directed path, , is a path whose all edges have the same orientation. A linear simple graph is called directed cordial if it admits 0 - 1 labeling t...
关键词：PATHS SECOND Power of PATH JOIN of PATHS CORDIAL Graph 
Some Edge Product Cordial Graphs in the Context of Duplication of Some Graph Elements
《Open Journal of Discrete Mathematics》2016年第4期248-258,共11页Udayan M. Prajapati Prakruti D. Shah 
For a graph, a function is called an edge product cordial labeling of G, if the induced vertex labeling function is defined by the product of the labels of the incident edges as such that the number of edges with labe...
关键词：Graph Labeling Edge Product Cordial Labeling Duplication of a Vertex 
Product Cordial Graph in the Context of Some Graph Operations on Gear Graph
《Open Journal of Discrete Mathematics》2016年第4期259-267,共9页Udayan M. Prajapati Karishma K. Raval 
A graph is said to be a product cordial graph if there exists a function with each edge assign the label , such that the number of vertices with label 0 and the number of vertices with label 1 differ atmost by 1, and ...
关键词：Product Cordial Labeling Gear Graph DUPLICATION Vertex Switching 
Edge Product Cordial Labeling of Some Cycle Related Graphs
《Open Journal of Discrete Mathematics》2016年第4期268-278,共12页Udayan M. Prajapati Nittal B. Patel 
For a graph having no isolated vertex, a function is called an edge product cordial labeling of graph G, if the induced vertex labeling function defined by the product of labels of incident edges to each vertex is suc...
关键词：Graph Labeling Edge Product Cordial Labeling 
Mean Cordial Labeling of Graphs
《Open Journal of Discrete Mathematics》2012年第4期145-148,共4页Raja Ponraj Muthirulan Sivakumar Murugesan Sundaram 
Let f be a map from V(G) to . For each edge uv assign the label . f is called a mean cordial la- beling if and , , where and denote the number of vertices and edges respectively labelled with x ( ). A graph with a mea...
关键词：Path STAR COMPLETE Graph COMB 
H- and H<sub>2</sub>-Cordial Labeling of Some Graphs
《Open Journal of Discrete Mathematics》2012年第4期149-155,共7页Freeda Selvanayagom Robinson S. Chellathurai 
In this paper we prove that the join of two path graphs, two cycle graphs, Ladder graph and the tensor product are H2-cordial labeling. Further we prove that the join of two wheel graphs Wn and Wm, (mod 4) admits a H-...
关键词：H-Cordial H2-Cordial JOIN of Two GRAPHS Split GRAPHS 
Prime Cordial Labeling of Some Graphs
《Open Journal of Discrete Mathematics》2012年第1期11-16,共6页Samir K. Vaidya Nirav H. Shah 
In this paper we prove that the split graphs of K1,n and Bn,n are prime cordial graphs. We also show that the square graph of Bn,n is a prime cordial graph while middle graph of Pn is a prime cordial graph for n≥4 . ...
关键词：PRIME CORDIAL LABELING SPLIT GRAPH Square GRAPH MIDDLE GRAPH 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部