Graph equations, graph inequalities and a fixed point theorem.
I.B. Lackovic, D.M. Cvetkovic (1976)
Publications de l'Institut Mathématique [Elektronische Ressource]
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.
I.B. Lackovic, D.M. Cvetkovic (1976)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Boštjan Brešar, Manoj Changat, Ajitha R. Subhamathi, Aleksandra Tepeh (2010)
Discussiones Mathematicae Graph Theory
Similarity:
The periphery graph of a median graph is the intersection graph of its peripheral subgraphs. We show that every graph without a universal vertex can be realized as the periphery graph of a median graph. We characterize those median graphs whose periphery graph is the join of two graphs and show that they are precisely Cartesian products of median graphs. Path-like median graphs are introduced as the graphs whose periphery graph has independence number 2, and it is proved that there are...
Pavol Híc (1992)
Mathematica Slovaca
Similarity:
Al-Addasi, Salah, Al-Ezeh, Hasan (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Ľubomír Šoltés (1992)
Mathematica Slovaca
Similarity:
Sizhong Zhou, Jiancheng Wu, Tao Zhang (2017)
Discussiones Mathematicae Graph Theory
Similarity:
A spanning subgraph F of a graph G is called a P≥3-factor of G if every component of F is a path of order at least 3. A graph G is called a P≥3-factor covered graph if G has a P≥3-factor including e for any e ∈ E(G). In this paper, we obtain three sufficient conditions for graphs to be P≥3-factor covered graphs. Furthermore, it is shown that the results are sharp.
Simić, Slobodan K. (1988)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity: