共 27 条
- [12] The Algorithm Research on the Strong Vertex-Distinguishing Total Coloring of Complete Graph 2012 INTERNATIONAL CONFERENCE ON INDUSTRIAL CONTROL AND ELECTRONICS ENGINEERING (ICICEE), 2012, : 652 - 654
- [17] Vertex-Distinguishing Total Coloring of Ladder Graphs (n ≡ 0(mod 8)) ADVANCED RESEARCH ON AUTOMATION, COMMUNICATION, ARCHITECTONICS AND MATERIALS, PTS 1 AND 2, 2011, 225-226 (1-2): : 243 - 246
- [18] The Smarandachely Adjacent Vertex Distinguishing E-total Coloring of Some Join Graphs SENSORS, MEASUREMENT AND INTELLIGENT MATERIALS II, PTS 1 AND 2, 2014, 475-476 : 379 - 382
- [19] The Smarandachely Adjacent Vertex Distinguishing E-total Coloring of a Number of 3-regular Graphs 2013 2ND INTERNATIONAL SYMPOSIUM ON INSTRUMENTATION AND MEASUREMENT, SENSOR NETWORK AND AUTOMATION (IMSNA), 2013, : 764 - 766
- [20] THE THETA-COMPLETE GRAPH RAMSEY NUMBER R(θn, K7); n = 7; n ≥ 14 JORDAN JOURNAL OF MATHEMATICS AND STATISTICS, 2021, 14 (03): : 517 - 526