On Querying Historical Connectivity in Temporal Graphs
Abstract
References
Index Terms
- On Querying Historical Connectivity in Temporal Graphs
Recommendations
On the connectivity of p-diamond-free graphs
For a vertex v of a graph G, we denote by d(v) the degree of v. The local connectivity@k(u,v) of two vertices u and v in a graph G is the maximum number of internally disjoint u-v paths in G, and the connectivity of G is defined as @k(G)=min{@k(u,v)|u,v@...
On the spanning fan-connectivity of graphs
Let G be a graph. The connectivity of G, @k(G), is the maximum integer k such that there exists a k-container between any two different vertices. A k-container of G between u and v, C"k(u,v), is a set of k-internally-disjoint paths between u and v. A ...
On the connectivity of p-diamond-free vertex transitive graphs
Let G be a graph of order n(G), minimum degree @d(G) and connectivity @k(G). We call the graph Gmaximally connected when @k(G)=@d(G). The graph G is said to be superconnected if every minimum vertex cut isolates a vertex. For an integer p>=1, we define ...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 179Total Downloads
- Downloads (Last 12 months)179
- Downloads (Last 6 weeks)49
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in