Results 51 to 60 of about 571 (72)
Controllability of a swarm of topologically interacting autonomous agents
, 2014 Controllability of complex networks has been the focal point of many recent studies in the field of complexity. These landmark advances shed a new light on the dynamics of natural and technological complex systems. Here, we analyze the controllability of
Bouffanais, Roland, Komareji, Mohammad
core
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
Graph measures and network robustness
, 2013 Network robustness research aims at finding a measure to quantify network robustness. Once such a measure has been established, we will be able to compare networks, to improve existing networks and to design new networks that are able to continue to ...
Ellens, W., Kooij, R. E.
core
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