NEPS OPERATIONS ON CORDIAL GRAPHS

被引:11
|
作者
KIRCHHERR, WW
机构
[1] Department of Mathematics and Computer Science, San Jose State University, San Jose
关键词
D O I
10.1016/0012-365X(93)90489-G
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
By using the structure of the adjacency matrix of a cordial graph, we characterize cordial graphs, then investigate sufficient conditions for NEPS graphs built from cordial graphs to be cordial. A sub-class of cordial graphs, symmetric balanced cordial graphs, is introduced.
引用
收藏
页码:201 / 209
页数:9
相关论文
共 50 条
  • [1] DIVISOR CORDIAL LABELING OF GRAPHS IN THE CONTEXT OF SOME GRAPH OPERATIONS
    Barasara, C. M.
    Thakkar, Y. B.
    ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2021, 28 (01): : 31 - 48
  • [2] SUM DIVISOR CORDIAL LABELING IN THE CONTEXT OF GRAPHS OPERATIONS ON BISTAR
    Adalja, Divya G.
    TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS, 2022, 12 (02): : 588 - 599
  • [3] A CONSTRUCTION OF CORDIAL GRAPHS FROM SMALLER CORDIAL GRAPHS
    LEE, SM
    LIU, A
    ARS COMBINATORIA, 1991, 32 : 209 - 214
  • [4] Energy and NEPS of graphs
    Stevanovic, D
    LINEAR & MULTILINEAR ALGEBRA, 2005, 53 (01): : 67 - 74
  • [5] A-CORDIAL GRAPHS
    HOVEY, M
    DISCRETE MATHEMATICS, 1991, 93 (2-3) : 183 - 194
  • [6] POWER CORDIAL GRAPHS
    Barasara, C. M.
    Thakkar, Y. B.
    JOURNAL OF APPLIED MATHEMATICS & INFORMATICS, 2024, 42 (02): : 445 - 456
  • [7] When is NEPS of graphs connected?
    Stevanovic, D
    LINEAR ALGEBRA AND ITS APPLICATIONS, 1999, 301 (1-3) : 137 - 144
  • [8] On product cordial graphs
    Seoud, M. A.
    Helmi, E. F.
    ARS COMBINATORIA, 2011, 101 : 519 - 529
  • [9] GCD-Graphs and NEPS of Complete Graphs
    Klotz, Walter
    Sander, Torsten
    ARS MATHEMATICA CONTEMPORANEA, 2013, 6 (02) : 289 - 299
  • [10] Diameter of the NEPS of bipartite graphs
    Brualdi, RA
    Shen, J
    DISCRETE MATHEMATICS, 2001, 226 (1-3) : 373 - 376