Skip to search formSkip to main contentSkip to account menu

Circuit rank

Known as: Cyclomatic number, Nullity 
In graph theory, a branch of mathematics, the circuit rank of an undirected graph is the minimum number of edges that must be removed from the graph… 
Wikipedia (opens in a new tab)

Related topics

Related topics

34 relations
Algebraic graph theoryBetti numberBicircular matroidConnected component (graph theory)

Broader (1)

Spanning tree

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
A case study of critique: Critical perspectives on critical accounting
Highly Cited
2013
Highly Cited
2013
Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
Tree‐width, and variants that restrict the allowable tree decompositions, play an important role in the study of graph algorithms… 
Highly Cited
2012
Highly Cited
2012
Linear Algebra
The subject of linear algebra includes the solution of linear equations, a topic properly belonging to college algebra. Earlier… 
Highly Cited
2012
Highly Cited
2012
On linear independence of T-spline blending functions
Highly Cited
2010
Highly Cited
2010
Evaluating Software Complexity Measures
  • E. Weyuker
  • IEEE Trans. Software Eng.
  • 2010
  • Corpus ID: 42595830
A set of properties of syntactic software complexity measures is proposed to serve as a basis for the evaluation of such measures… 
Highly Cited
2009
Highly Cited
2009
On the Nullity of Bipartite Graphs
  • G. Omidi
  • Graphs Comb.
  • 2009
  • Corpus ID: 10345353
The nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. We obtain some lower bounds for the nullity of… 
Highly Cited
2001
Highly Cited
2001
On the nullity of line graphs of trees
Review
1999
Review
1999
Syntactic Measures of Complexity
This thesis analyses the conception and measurement of complexity and then applies it to some aspects of formal languages. It… 
1982
1982
Rank of maximum matchings in a graph
AbstractThe matching polytope is the convex hull of the incidence vectors of all (not necessarily perfect) matchings of a graphG… 
Highly Cited
1979
Highly Cited
1979
An Experiment in Software Error Data Collection and Analysis
The propensity to make programming errors and the rates of error detection and correction are dependent on program complexity… 
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)