Results 51 to 60 of about 89 (84)
Rainbow Vertex-Connection and Forbidden Subgraphs
Discussiones Mathematicae Graph Theory, 2018 A path in a vertex-colored graph is called vertex-rainbow if its internal vertices have pairwise distinct colors. A vertex-colored graph G is rainbow vertex-connected if for any two distinct vertices of G, there is a vertex-rainbow path connecting them ...
Li Wenjing, Li Xueliang, Zhang Jingshu
doaj +1 more source
Decomposition of the Product of Cycles Based on Degree Partition
Discussiones Mathematicae Graph Theory, 2019 The Cartesian product of n cycles is a 2n-regular, 2n-connected and bi- pancyclic graph. Let G be the Cartesian product of n even cycles and let 2n = n1+ n2+ ・ ・ ・ + nkwith k ≥ 2 and ni≥ 2 for each i. We prove that if k = 2, then G can be decomposed into
Borse Y. M., Shaikh S. R.
doaj +1 more source
On Radio Connection Number of Graphs
Discussiones Mathematicae Graph Theory, 2019 Given a graph G and a vertex coloring c, G is called l-radio connected if between any two distinct vertices u and v there is a path such that coloring c restricted to that path is an l-radio coloring.
Marinescu-Ghemeci Ruxandra
doaj +1 more source
A Sufficient Condition for Graphs to Be Super K-Restricted Edge Connected
Discussiones Mathematicae Graph Theory, 2017 For a subset S of edges in a connected graph G, S is a k-restricted edge cut if G − S is disconnected and every component of G − S has at least k vertices.
Wang Shiying, Wang Meiyu, Zhang Lei
doaj +1 more source
Arc Fault Tolerance of Cartesian Product of Regular Digraphs on Super-Restricted Arc-Connectivity
Discussiones Mathematicae Graph Theory, 2019 Let D = (V (D),A(D)) be a strongly connected digraph. An arc set S ⊆ A(D) is a restricted arc-cut of D if D − S has a non-trivial strong component D1 such that D − V (D1) contains an arc.
Zhang Guozhen, Wang Shiying
doaj +1 more source
Continuum Theory in the Digital Setting
, 1996 Various aspects of connectivity in the topological and graph-theoretic settings are related using topological graphs, which were introduced in [14]. Various constructions in continuum theory using inverse sequences of spaces are expressed in terms of ...
Julian Webster
core
Erdős-Gallai-Type Results for Total Monochromatic Connection of Graphs
Discussiones Mathematicae Graph Theory, 2019 A graph is said to be total-colored if all the edges and the vertices of the graph are colored. A total-coloring of a graph is a total monochromatically-connecting coloring (TMC-coloring, for short) if any two vertices of the graph are connected by a ...
Jiang Hui, Li Xueliang, Zhang Yingying
doaj +1 more source
Zagreb eccentricity indices of cycles related graphs
, 2016 Graph theory, with its diverse applications in theoretical computer science and in natural (Chemistry, Biology) in particular is becoming an important component of the mathematics. Recently, the concepts of new zagreb eccentricity indices were introduced.
Turaci, T.
core
Discussiones Mathematicae Graph Theory, 2019 Let G be a connected graph with minimum degree δ and edge-connectivity λ. A graph is maximally edge-connected if λ = δ, and it is super-edgeconnected if every minimum edge-cut is trivial; that is, if every minimum edge-cut consists of edges incident with
Volkmann Lutz
doaj +1 more source
On the neighbour vulnerability of recursive graphs
, 2006 The vulnerability of the communication network measures the resistance of the network to disruption of operation after the failure of certain stations or communication links.
Aytaç A., Dündar P.
core