Matrices representable by directed graphs
Zofia Majcher (1985)
Archivum Mathematicum
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Graphic matrices”
Matrices representable by directed graphs
On some regularities of graphs. II.
Zofia Majcher (1984)
Časopis pro pěstování matematiky
Similarity:
Characterization of a signed graph whose signed line graph is -consistent.
Acharya, B.Devadas, Acharya, Mukti, Sinha, Deepa (2009)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
A note on outerplanarity of product graphs
P K. Jha, G Slutzki (1991)
Applicationes Mathematicae
Similarity:
Discussing graph theory with a computer. II: Theorems suggested by the computer.
Cvetkovic, Dragos M. (1983)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Supermagic Graphs Having a Saturated Vertex
Jaroslav Ivančo, Tatiana Polláková (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is called supermagic if it admits a labeling of the edges by pairwise different consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we establish some conditions for graphs with a saturated vertex to be supermagic. Inter alia we show that complete multipartite graphs K1,n,n and K1,2,...,2 are supermagic.