On the odd harmonious graphs with applications
By Zhihe Liang, Zhanning Bai. 2009
54 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Electrical and Electronic Engineering, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/69522a68054309ecf0db11fc4231c86d4558bc3f
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Electrical and Electronic Engineering
In Geometry and Topology
Citations in the corpus
- A Dynamic Survey of Graph Labeling (2009, background): “Liang and Bai [787] have show the following: odd-harmonious graphs are bipartite; if a (p, q)-graph is odd-harmonious, then 2 √ q ≤ p ≤ 2q − 1; if a (p, q)graph with degree sequence (d1, d2, .”