CONNECTIVITY IN GRAPHS (Mathematical Expositions No.15)doi:10.1112/jlms/s1-43.1.554Dirac, G. AOxford University PressJournal of the London Mathematical Society
On the time required to detect cycles and connectivity in graphs Bollobás posed the problem of finding the least number of edges,f(n), possible in a maximally nonhamiltonian graph of ordern. Results of Bondy show thatf(n) ≤3/2 n forn ≤ 7. We exhibit graphs of even ordern ≥ 36 ...
On the pedant tree-connectivity of graphs Recently, the authors introduced a game invariant of graphs, called a game connectivity. In this paper, we investigate the edge version of the invariant, c... Y Mao - arXiv e-prints 被引量: 0发表: 2015年 Path-connectivity in graphs We call a ...
Code Issues Pull requests A dynamic connectome mapping module in python. python clustering dynamic graphs neuroscience meg eeg connectivity neuroimaging fmri graph-analysis connectome functional-connectivity time-varying fc-states graph-distances Updated Jul 24, 2023 Python csye...
The generalized k-connectivity κk(G) of a graph G is a generalization of the concept of the traditional connectivity, which can serve for measuring the capability of a graph G to connect any k vertices in G. In a search for triangle-free graphs with arbitrarily large chromatic numbers, My...
Algebraic Connectivity and Disjoint Vertex Subsets of Graphs In this work, the relationships are researched between the algebraic connectivity and disjoint vertex subsets of graphs, which are presented through some upper bounds. 2. Preliminaries Let be a vector. Let be an incidence matrix of . .....
Furthermore, the relationship between super point-connectivity and super edge-connectivity on the Cartesian product of graphs is pointed out. Introduction A graph G=(V,E) is maximum edge-connected (in short, max-λ) if λ=[2q/p], where p=|V|,q=|E| and λ=λ(G) is the edge-...
In this paper, we first introduce the concepts of super restricted connectivity and super restricted edge connectivity and then give a property of graphs with equal p-restricted edge connectivity and 1–p-restricted connectivity. Applying this property, we show a sufficient condition for a line ...
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logar... S Fahmy,K Park 被引量: 0发表: 2003年 Scalability and traffic control in IP networks C. Claffy, Internet topology: Connectivity of IP gr...
In this paper, we study the relationship between eigenvalues and the existence of certain subgraphs in regular graphs. We give a condition on an appropriate eigenvalue that guarantees a lower bound for the matching number of a t-edge-connected d-regular graph when t <= d - 2. This work ...