A note on the vertex-switching reconstruction.
Krasikov, I. (1988)
International Journal of Mathematics and Mathematical Sciences
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.
Displaying similar documents to “Note on linear arboricity”
A note on the vertex-switching reconstruction.
Downhill Domination in Graphs
Teresa W. Haynes, Stephen T. Hedetniemi, Jessie D. Jamieson, William B. Jamieson (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A path π = (v1, v2, . . . , vk+1) in a graph G = (V,E) is a downhill path if for every i, 1 ≤ i ≤ k, deg(vi) ≥ deg(vi+1), where deg(vi) denotes the degree of vertex vi ∈ V. The downhill domination number equals the minimum cardinality of a set S ⊆ V having the property that every vertex v ∈ V lies on a downhill path originating from some vertex in S. We investigate downhill domination numbers of graphs and give upper bounds. In particular, we show that the downhill domination number...
Signed -matchings in graphs.
Ghameshlou, A.N., Saei, R., Sheikholeslami, S.M., Volkmann, L. (2010)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
Similarity:
The min-max supergraph
Gary Chartrand, Ronald J. Gould, S. F. Kapoor (1980)
Mathematica Slovaca
Similarity:
The linear arboricity of -regular graphs
Filip Guldan (1986)
Mathematica Slovaca
Similarity:
On equality of edge-connectivity and minimum degree of a graph
Ján Plesník, Štefan Znám (1989)
Archivum Mathematicum
Similarity: