<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05613303</id>
  <dt>j</dt>
  <an>05613303</an>
  <augroup>
    <au>Vaidya, S.K.</au>
    <au>Dani, N.A.</au>
    <au>Kanani, K.K.</au>
    <au>Vihol, P.L.</au>
  </augroup>
  <ti>Some wheel related 3-equitable graphs in the context of vertex duplication.</ti>
  <so>Adv. Appl. Discrete Math. 4, No. 1, 71-85 (2009).</so>
  <py>2009</py>
  <pu>Pushpa Publishing House, Allahabad, Uttar Pradesh, India</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>3-equitable labeling</ut>
    <ut>duplication</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>http://pphmj.com/abstract/4225.htm</li>
  </ligroup>
  <abgroup>
    <ab>Summary: In the present investigations, we prove that the graph obtained by duplication of arbitrary rim vertex of wheel $W_n$ and duplication of apex vertex of wheel $W_n$ for even $n$ is 3-equitable and not 3-equitable for odd $n$, where $n\geq 5$. In addition to this we prove that duplication of vertices of wheel $W_n$ altogether is 3-equitable except $n=5$.</ab>
    <rv></rv>
  </abgroup>
</item>