Skip to search formSkip to main contentSkip to account menu

Connectivity (graph theory)

Known as: Connected (Graph Theory), Strongly-connected digraph, Disconnected graph 
In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Adjacency matrixAlgebraic connectivityApollonian networkArgus - Audit Record Generation and Utilization System

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Extremal Unicyclic and Bicyclic Graphs with Respect to Harary Index
The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. In this… 
2007
2007
ON THE LARGEST EIGENVALUE OF THE DISTANCE MATRIX OF A TREE
The largest eigenvalue Λ1 of the distance matrix of a tree has been proposed as a structure–descriptor. We provide upper and… 
2004
2004
The price of connectedness in expansions
Expansion is the way of generalizing different graph layout and searching problems. We initiate the study of connected expansion… 
Review
2003
Review
2003
A Survey and Performance Evaluation of Scalable Tree-based Application Layer Multicast Protocols
Application layer multicast (ALM) enables rapid deployment of multicast applications in the Internet. In ALM, application hosts… 
2002
2002
Radio antipodal colorings of graphs
A radio antipodal coloring of a connected graph $G$ with diameter $d$ is an assignment of positive integers to the vertices of $G… 
2002
2002
ANALYSIS AND DESIGN OF POWER SYSTEM STABILIZERS AND FACTS BASED STABILIZERS USING GENETIC ALGORITHMS
Power system stability enhancement via a power system stabilizer (PSS) and FACTS-based stabilizers is thoroughly investigated in… 
Highly Cited
2000
Highly Cited
2000
Improving the Up ∗ /Down ∗ Routing Scheme for Networks of Workstations (cid:1)
. Networks of workstations (NOWs) are being considered as a cost-effective alternative to parallel computers. Many NOWs are… 
1996
1996
First and second order diffusive methods for rapid, coarse, distributed load balancing (extended abstract)
We consider the following general problem modeling load balancing in a variety of distributed settings. Given an arbitrary… 
1995
1995
ON THE PERIOD-TWO-PROPERTY OF THE MAJORITY OPERATOR IN INFINITE GRAPHS
A self-mapping M : X —» X of a nonempty set X has the Period- Two-Property (p2p) if M2x = x holds for every Af-periodic point x e… 
Highly Cited
1991
Highly Cited
1991
Constructing multidimensional spanner graphs
Given a connected graph G=(V,E) with positive edge weights, define the distance dG(u,v) between vertices u and v to be the length… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)