Results 51 to 60 of about 567 (69)
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 note on nowhere-zero 3-flow and Z_3-connectivity
, 2014 There are many major open problems in integer flow theory, such as Tutte's 3-flow conjecture that every 4-edge-connected graph admits a nowhere-zero 3-flow, Jaeger et al.'s conjecture that every 5-edge-connected graph is $Z_3$-connected and Kochol's ...
Chen, Fuyuan, Ning, Bo
core +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
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
Connectivity Concepts in Intuitionistic Fuzzy Incidence Graphs with Application. [PDF]
Int J Appl Comput Math, 2022 Nazeer I, Rashid T.
europepmc +1 more source
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
The Path-Pairability Number of Product of Stars
Discussiones Mathematicae Graph Theory, 2019 The study of a graph theory model of certain telecommunications network problems lead to the concept of path-pairability, a variation of weak linkedness of graphs.
Jobson Adam S. +3 more
doaj +1 more source
Properties of uniformly $3$-connected graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceA graph on at least ${{k+1}}$ vertices is uniformly $k$-connected if each pair of its vertices is connected by $k$ and not more than $k$ independent paths.
Frank Göring, Tobias Hofmann
doaj +1 more source
Connectivity of Triangulation Flip Graphs in the Plane. [PDF]
Discrete Comput Geom, 2022 Wagner U, Welzl E.
europepmc +1 more source