Graphic matrices

Zofia Majcher

Mathematica Slovaca (1988)

  • Volume: 38, Issue: 3, page 193-205
  • ISSN: 0232-0525

How to cite

top

Majcher, Zofia. "Graphic matrices." Mathematica Slovaca 38.3 (1988): 193-205. <http://eudml.org/doc/31608>.

@article{Majcher1988,
author = {Majcher, Zofia},
journal = {Mathematica Slovaca},
keywords = {(*)-switching operation; finite simple graphs; matrix},
language = {eng},
number = {3},
pages = {193-205},
publisher = {Mathematical Institute of the Slovak Academy of Sciences},
title = {Graphic matrices},
url = {http://eudml.org/doc/31608},
volume = {38},
year = {1988},
}

TY - JOUR
AU - Majcher, Zofia
TI - Graphic matrices
JO - Mathematica Slovaca
PY - 1988
PB - Mathematical Institute of the Slovak Academy of Sciences
VL - 38
IS - 3
SP - 193
EP - 205
LA - eng
KW - (*)-switching operation; finite simple graphs; matrix
UR - http://eudml.org/doc/31608
ER -

References

top
  1. BALABAN A. T., KEREK F., Graphs of parallel and or substitution reactions, Rev. Roum de Chemie 19, 1974, No. 4, 631-647. (1974) 
  2. BERGE C., Gгaphs and Hypergraphs, North-Holland, Amsterdam 1973. (1973) MR1013569
  3. EGGLETON R. B., Graphic sequences and graphic polynomials: a report. Infinite and Finite Sets, Colloqu. Math. Soc. J. Bolyai 10, 1973, 385-392. (1973) MR0384612
  4. EGGLETON R. B., HOLTON D. A., Graphic sequences, Combinatorial Math. VI. Proc. бth Australian Conf. on Combinatorial Math., Armidale, 1978, Springer-Verlag 1979, 1-10. (1978) MR0558028
  5. EGGLETON R. B., HOLTON D. A., Simple and multigraphic realizations of degree sequences, Combinatorial Math. VIII. Proc. Geelong, Australia 1980, Springer-Verlag 1981, 155-172. (1980) MR0641245
  6. ERDÖS P., GALLAI T., Graphs with prescribed degrees of vertices (in Hungarian), Mat. Lapok 11, 1960, 264-274. (1960) 
  7. EVANS C. W., Some properties of semi-regular graphs, match 6, 1979, 117-135. (1979) Zbl0442.05059MR0554049
  8. GALE D., A theorem in folows in networks, Pacific J. Math. 7, 1957, 1073-1082. (1957) MR0091855
  9. HAKIMI S. L., On the realizability of a set of integers as degrees of the vertices of a linear graph, I. J. SIAM 10, 1962, 496-506. (1962) MR0148049
  10. HARARY F., Graph Theory, Addison-Vesley, Mass. 1969. (1969) Zbl0196.27202MR0256911
  11. HAVEL V., A remark on the existence of finite graphs (in Czech), Čas. pěst. mat. 80, 1955, 477-480. (1955) 
  12. MAJCHER Z., Matrices representable by graphs.: Teubner-Texte zur Mathematik, Band 59, Proc. of the Third Czechoslovak Symposium on Graph Theory, Prague 1982, BSB B. G. Teubner Verlagsgesellschaft, 1983, 178-182. (1982) MR0737034
  13. MAJCHER Z., On some regularities of graphs II, Čas. pӗst. mat. 109, 1984, 380-388. (1984) Zbl0576.05058MR0774280
  14. MAJCHER Z., Algorithms for constructing paths in a graph of realizations of a degree sequence, (to appear). 
  15. PŁONKA J., On Г-regular graphs, Colloquium Math. 46, 1982, 131-134. (1982) MR0672373
  16. PŁONKA J., On some regularities of graphs I, Čas. pӗst. mat. 107, 1982, 231-240. (1982) MR0673047
  17. RAMA CHANDRAN S., Nearly regular graphs and their reconstruction, Graph Theory Newsletter B, 3, 1978. (1978) 
  18. TAYLOR R., Constrained switchings in graphs, Combinatorial Math. VIII. Proc. Geelong, Australia 1980, Springer-Verlag 1981, 314-336. (1980) MR0641256

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.