Title
Chordless Cycles In Networks
Abstract
Using closure concepts, we show that within every undirected network, or graph, there is a unique irreducible subgraph. The chordless cycles which comprise this irreducible core effectively characterize the connectivity structure of the network as a whole. By counting the number of cycles of length 3 <= k <= max_length, we can also create a kind of signature that can be used to identify the network. Its longest chordless cycles can be used to redraw the network and visually reveal its global connectivity patterns.Performance is analyzed, and the concepts we develop are illustrated by means of a relatively small running sample network of about 400 nodes.
Year
DOI
Venue
2013
10.1109/ICDEW.2013.6547454
2013 IEEE 29TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING WORKSHOPS (ICDEW)
Keywords
Field
DocType
computer science,algorithm design and analysis,collaboration,graph theory
Network science,Graph theory,Graph,Computer science,Theoretical computer science,Connectivity
Conference
ISSN
Citations 
PageRank 
1943-2895
0
0.34
References 
Authors
0
1
Name
Order
Citations
PageRank
John L. Pfaltz112791221.24