Locally connected graphs
Gary Chartrand, Raymond E. Pippert (1974)
Časopis pro pěstování matematiky
Similarity:
Gary Chartrand, Raymond E. Pippert (1974)
Časopis pro pěstování matematiky
Similarity:
Bohdan Zelinka (1986)
Mathematica Slovaca
Similarity:
A.P. Santhakumaran, P. Titus (2012)
Discussiones Mathematicae Graph Theory
Similarity:
For a connected graph G of order p ≥ 2 and a vertex x of G, a set S ⊆ V(G) is an x-monophonic set of G if each vertex v ∈ V(G) lies on an x -y monophonic path for some element y in S. The minimum cardinality of an x-monophonic set of G is defined as the x-monophonic number of G, denoted by mₓ(G). An x-monophonic set of cardinality mₓ(G) is called a mₓ-set of G. We determine bounds for it and characterize graphs which realize these bounds. A connected graph of order p with vertex monophonic...
Hansberg, Adriana, Meierling, Dirk, Volkmann, Lutz (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hartmann, Sven, Little, C.H.C. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Xueliang Li, Yongtang Shi (2013)
Discussiones Mathematicae Graph Theory
Similarity:
A vertex-colored graph is rainbow vertex-connected if any two vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex-connection of a connected graph G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G rainbow vertexconnected. It was proved that if G is a graph of order n with minimum degree δ, then rvc(G) < 11n/δ. In this paper, we show that rvc(G) ≤ 3n/(δ+1)+5 for [xxx] and n ≥ 290, while rvc(G) ≤ 4n/(δ...
Bohdan Zelinka (1981)
Časopis pro pěstování matematiky
Similarity: