Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,227,208 papers from all fields of science
Search
Sign In
Create Free Account
Connectivity (graph theory)
Known as:
Connected (Graph Theory)
, Strongly-connected digraph
, Disconnected graph
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Adjacency matrix
Algebraic connectivity
Apollonian network
Argus - Audit Record Generation and Utilization System
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Decompositions of graphs into a given clique-extension
Teresa Sousa
Ars Comb.
2011
Corpus ID: 17411452
For r ≥ 3, a clique-extension of order r + 1 is a connected graph that consists of a Kr plus another vertex adjacent to at most r…
Expand
2007
2007
A PSO-based SSSC Controller for Improvement of Transient Stability Performance
S. Panda
,
N. Padhy
2007
Corpus ID: 2106290
The application of a Static Synchronous Series Compensator (SSSC) controller to improve the transient stability performance of a…
Expand
2007
2007
Application of Genetic Algorithm for FACTS-based Controller Design
S. Panda
,
N. Padhy
,
R. Patel
2007
Corpus ID: 7025602
— In this paper, genetic algorithm (GA) opmization technique is applied to design Flexible AC Transmission System (FACTS)-based…
Expand
2006
2006
Rooted Tree and Spanning Tree Constraints
P. Prosser
,
Chris Unsworth
2006
Corpus ID: 8648875
We present two specialised constraints for modelling trees. The first constrains a set of variables, such that each variable…
Expand
2004
2004
The price of connectedness in expansions
F. Fomin
,
P. Fraigniaud
,
Dimitrios Thilikos Touloupas
2004
Corpus ID: 6676992
Expansion is the way of generalizing different graph layout and searching problems. We initiate the study of connected expansion…
Expand
Review
2003
Review
2003
A Survey and Performance Evaluation of Scalable Tree-based Application Layer Multicast Protocols
Su-Wei Tan
,
A. Waters
,
John S. Crawford
2003
Corpus ID: 13925385
Application layer multicast (ALM) enables rapid deployment of multicast applications in the Internet. In ALM, application hosts…
Expand
2000
2000
An Adaptive Systems Approach to the Implementation and Evaluation of Digital Library Recommendation Systems
J. Bollen
,
Luis Mateus Rocha
European Conference on Research and Advanced…
2000
Corpus ID: 31324116
The focus for information retrieval systems in digital libraries has shifted from passive repositories of information to…
Expand
1995
1995
ON THE PERIOD-TWO-PROPERTY OF THE MAJORITY OPERATOR IN INFINITE GRAPHS
G. Moran
1995
Corpus ID: 46283692
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…
Expand
1992
1992
An improvement of fraisse's sufficient condition for hamiltonian graphs
A. Ainouche
Journal of Graph Theory
1992
Corpus ID: 5169027
Let G be a k-connected graph of order n. For an independent set c, let d(S) be the number of vertices adjacent to at least one…
Expand
1984
1984
Discrete ordered sets whose covering graphs are median
H. Bandelt
1984
Corpus ID: 121123265
As is well known the covering graph ( = Hasse diagram) of any median semilattice is a median graph, and every median graph is the…
Expand