The basis number of some special non-planar graphs
Salar Y. Alsardary; Ali A. Ali
Czechoslovak Mathematical Journal (2003)
- Volume: 53, Issue: 2, page 225-240
- ISSN: 0011-4642
Access Full Article
topAbstract
topHow to cite
topAlsardary, Salar Y., and Ali, Ali A.. "The basis number of some special non-planar graphs." Czechoslovak Mathematical Journal 53.2 (2003): 225-240. <http://eudml.org/doc/30772>.
@article{Alsardary2003,
abstract = {The basis number of a graph $G$ was defined by Schmeichel to be the least integer $h$ such that $G$ has an $h$-fold basis for its cycle space. He proved that for $m,n\ge 5$, the basis number $b(K_\{m,n\})$ of the complete bipartite graph $K_\{m,n\}$ is equal to 4 except for $K_\{6,10\}$, $K_\{5,n\}$ and $K_\{6,n\}$ with $n=5,6,7,8$. We determine the basis number of some particular non-planar graphs such as $K_\{5,n\}$ and $K_\{6,n\}$, $n=5,6,7,8$, and $r$-cages for $r=5,6,7,8$, and the Robertson graph.},
author = {Alsardary, Salar Y., Ali, Ali A.},
journal = {Czechoslovak Mathematical Journal},
keywords = {graphs; basis number; cycle space; basis; graphs; basis number; cycle space; basis},
language = {eng},
number = {2},
pages = {225-240},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {The basis number of some special non-planar graphs},
url = {http://eudml.org/doc/30772},
volume = {53},
year = {2003},
}
TY - JOUR
AU - Alsardary, Salar Y.
AU - Ali, Ali A.
TI - The basis number of some special non-planar graphs
JO - Czechoslovak Mathematical Journal
PY - 2003
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 53
IS - 2
SP - 225
EP - 240
AB - The basis number of a graph $G$ was defined by Schmeichel to be the least integer $h$ such that $G$ has an $h$-fold basis for its cycle space. He proved that for $m,n\ge 5$, the basis number $b(K_{m,n})$ of the complete bipartite graph $K_{m,n}$ is equal to 4 except for $K_{6,10}$, $K_{5,n}$ and $K_{6,n}$ with $n=5,6,7,8$. We determine the basis number of some particular non-planar graphs such as $K_{5,n}$ and $K_{6,n}$, $n=5,6,7,8$, and $r$-cages for $r=5,6,7,8$, and the Robertson graph.
LA - eng
KW - graphs; basis number; cycle space; basis; graphs; basis number; cycle space; basis
UR - http://eudml.org/doc/30772
ER -
References
top- On the basis number of a graph, Dirasat (Science) 14 (1987), 43–51. (1987)
- 10.1016/0095-8956(82)90061-2, J. Combin Theory, Ser. B 33 (1982), 95–100. (1982) MR0685059DOI10.1016/0095-8956(82)90061-2
- Graph Theory with Applications, Amer. Elsevier, New York, 1976. (1976) MR0411988
- Graph Theory, 2nd ed., Addison-Wesely, Reading, Massachusetts, 1971. (1971)
- A combinatorial condition for planar graphs, Fund. Math. 28 (1937), 22–32. (1937) Zbl0015.37501
- The smallest graph of girth 5 and valency 4, Bull. Amer. Math. Soc. 30 (1981), 824–825. (1981) MR0167974
- 10.1016/0095-8956(81)90057-5, J. Combin. Theory, Ser. B 30 (1981), 123–129. (1981) Zbl0385.05031MR0615307DOI10.1016/0095-8956(81)90057-5
- Connectivity in Graphs, Univ. Toronto press, Toronto, 1966. (1966) Zbl0146.45603MR0210617
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.