-
1“...Let G=(V(G),E(G)) be a simple, finite and undirected graph of order p and size q. A bijection f:V(G...”
Get full text
Article -
2“... and undirected graph of order <i>n</i>. Given a bijection <inline-formula><math xmlns="http://www.w3.org/1998...”
Get full text
Article