A characterization of -closed graphs
Pavol Híc (1989)
Mathematica Slovaca
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.
Pavol Híc (1989)
Mathematica Slovaca
Similarity:
Al-Addasi, Salah, Al-Ezeh, Hasan (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity:
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.
Gurusamy Rengasamy Vijayakumar (2013)
Discussiones Mathematicae Graph Theory
Similarity:
The infimum of the least eigenvalues of all finite induced subgraphs of an infinite graph is defined to be its least eigenvalue. In [P.J. Cameron, J.M. Goethals, J.J. Seidel and E.E. Shult, Line graphs, root systems, and elliptic geometry, J. Algebra 43 (1976) 305-327], the class of all finite graphs whose least eigenvalues ≥ −2 has been classified: (1) If a (finite) graph is connected and its least eigenvalue is at least −2, then either it is a generalized line graph or it is represented...
Filip Guldan (1987)
Časopis pro pěstování matematiky
Similarity: