On strongly connected orientations of graphs
Matúš Harminc (1999)
Discussiones Mathematicae Graph Theory
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.
Displaying similar documents to “Characterizations of m-connected graphs”
On strongly connected orientations of graphs
Applications of relaxed submodularity.
Frank, András (1998)
Documenta Mathematica
Similarity:
Isomorphic components of Kronecker product of bipartite graphs
Pranava K. Jha, Sandi Klavžar, Blaž Zmazek (1997)
Discussiones Mathematicae Graph Theory
Similarity:
Weichsel (Proc. Amer. Math. Soc. 13 (1962) 47-52) proved that the Kronecker product of two connected bipartite graphs consists of two connected components. A condition on the factor graphs is presented which ensures that such components are isomorphic. It is demonstrated that several familiar and easily constructible graphs are amenable to that condition. A partial converse is proved for the above condition and it is conjectured that the converse is true in general.
A technique for reconstructing disconnected graphs
Gary Chartrand, Hudson V. Kronk, Seymour Schuster (1973)
Colloquium Mathematicae
Similarity:
Some easily derivable integer sequences.
Liskovets, Valery A. (2000)
Journal of Integer Sequences [electronic only]
Similarity:
On Graphs Whose Energy Does Not Exceed 4
Mirko Lepović (1991)
Publications de l'Institut Mathématique
Similarity:
n-Arc connected spaces
Benjamin Espinoza, Paul Gartside, Ana Mamatelashvili (2013)
Colloquium Mathematicae
Similarity:
A space is n-arc connected (n-ac) if any family of no more than n-points are contained in an arc. For graphs the following are equivalent: (i) 7-ac, (ii) n-ac for all n, (iii) continuous injective image of a closed subinterval of the real line, and (iv) one of a finite family of graphs. General continua that are ℵ₀-ac are characterized. The complexity of characterizing n-ac graphs for n = 2,3,4,5 is determined to be strictly higher than that of the stated characterization of 7-ac graphs. ...
A note on intersecting graphs.
Bretto, A. (1999)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity:
'3in1' enhanced: three squared ways to '3in1' GRAPHS
Zdzisław Skupień (2007)
Discussiones Mathematicae Graph Theory
Similarity:
Chord graphs - new means for representing graphs
W. Wessel (1987)
Applicationes Mathematicae
Similarity:
A Generalized Direct Product Of Graphs
Risto Šokarovski (1977)
Publications de l'Institut Mathématique
Similarity:
Nonexistence of triples of nonisomorphic connected graphs with isomorphic connected -graphs.
Li, Xueliang, Liu, Yan (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the domination of functions by graphs
S. F. Kapoor, Linda M. Lesniak (1976)
Colloquium Mathematicae
Similarity:
Relating 2-Rainbow Domination To Roman Domination
José D. Alvarado, Simone Dantas, Dieter Rautenbach (2017)
Discussiones Mathematicae Graph Theory
Similarity:
For a graph G, let R(G) and yr2(G) denote the Roman domination number of G and the 2-rainbow domination number of G, respectively. It is known that yr2(G) ≤ R(G) ≤ 3/2yr2(G). Fujita and Furuya [Difference between 2-rainbow domination and Roman domination in graphs, Discrete Appl. Math. 161 (2013) 806-812] present some kind of characterization of the graphs G for which R(G) − yr2(G) = k for some integer k. Unfortunately, their result does not lead to an algorithm that allows to recognize...