Bipartite Diametrical Graphs of Diameter 4 and Extreme Orders
We provide a process to extend any bipartite diametrical graph of diameter 4 to an 𝑆-graph of the same diameter and partite sets. For a bipartite diametrical graph of diameter 4 and partite sets 𝑈 and 𝑊, where 2𝑚=|𝑈|≤|𝑊|, we prove that 2𝑚 is a sharp upper bound of |𝑊| and construct an 𝑆-graph 𝐺(2𝑚...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2008-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/2008/468583 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|