Results 61 to 70 of about 89 (84)
The Path-Pairability Number of Product of Stars
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]
A 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
. 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
On primality of Cartesian product of graphs [PDF]
PurposeThe 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
A 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
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Automorphisms of linear functional graphs over vector spaces
Linear and Multilinear Algebra, 2022Ali Majidinya
exaly
On some degree based topological indices of mk-graph
Journal of Discrete Mathematical Sciences and Cryptography, 2020Nilanjan De +2 more
exaly
The Monochromatic Connectivity of Graphs
Taiwanese Journal of Mathematics, 2020Xueliang Li, Zemin Jin
exaly
Component connectivity of the hypercubes
International Journal of Computer Mathematics, 2012László Lipták +2 more
exaly

