Results 61 to 70 of about 101 (95)
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
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
On Finding a Smallest Augmentation to Biconnect a Graph
, 1993 . We consider the problem of finding a minimum number of edges whose addition biconnects an undirected graph. This problem has been studied by several other researchers, two of whom presented a linear time algorithm for this problem in an earlier volume ...
Vijaya Ramachandran, Tsan-sheng Hsu
core
Connectivity of Triangulation Flip Graphs in the Plane. [PDF]
Discrete Comput Geom, 2022 Wagner U, Welzl E.
europepmc +1 more source
On primality of Cartesian product of graphs [PDF]
Arab Journal of Mathematical SciencesPurposeThe present work focuses on the primality and the Cartesian product of graphs.Design/methodology/approachGiven a graph G, a subset M of V (G) is a module of G if, for a, b ∈ M and x ∈ V (G) \ M, xa ∈ E(G) if and only if xb ∈ E(G).
Nadia El Amri +2 more
doaj +1 more source
Structure of the space of taboo-free sequences. [PDF]
J Math Biol, 2020 Manuel C, von Haeseler A.
europepmc +1 more source
Forum of Mathematics, SigmaA classical problem, due to Gerencsér and Gyárfás from 1967, asks how large a monochromatic connected component can we guarantee in any r-edge colouring of $K_n$ ?
Noga Alon +3 more
doaj +1 more source
A Suzuki-type multivalued contraction on weak partial metric spaces and applications. [PDF]
J Inequal Appl, 2018 Aydi H +3 more
europepmc +1 more source