Skip to search formSkip to main contentSkip to account menu

Pseudoforest

Known as: Near-tree, Maximal pseudoforest, Unicyclic 
In graph theory, a pseudoforest is an undirected graph in which every connected component has at most one cycle. That is, it is a system of vertices… 
Wikipedia (opens in a new tab)

Related topics

Related topics

48 relations
AlgorithmArboricityBicircular matroidButterfly graph

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
A Note on the Nullity of Unicyclic Graphs
The nullity of a graph is the multiplicity of the eigenvalue zero in its spectrum. In this paper we show the expression of the… 
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… 
2009
2009
First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph
2009
2009
On the Reverse Wiener Indices of Unicyclic Graphs
We determine the maximum values of the reverse Wiener indices of the unicyclic graphs with given cycle length, number of pendent… 
2008
2008
A model-based approach for systematic risk analysis
A modelling approach based on a mixed structural/functional graph that allows the simultaneous representation of the structural… 
2003
2003
First six unicyclic graphs of order n with larger spectral radius
In this paper,the second,third,fourth,fifth and sixth largest values,which only relate to the order of graphs,of the largest… 
Review
1999
Review
1999
A note on CSP graph parameters
Several graph parameters such as induced width, minimum maximum clique size of a chordal completion, k-tree number, bandwidth… 
Highly Cited
1997
Highly Cited
1997
Functional programming with graphs
Graph algorithms expressed in functional languages often suffer from their inherited imperative, state-based style. In particular… 
Highly Cited
1977
Highly Cited
1977
A Lifo Implicit Enumeration Search Algorithm for the Symmetric Traveling Salesman Problem Using Held and Karp's 1-Tree Relaxation
1972
1972
Bounds on the Length of Terminal Stuck-Fault Test
A terminal stuck fault in a logic network is represented by one or more stuck-at-1 or stuck-at-0 faults on the n input lines or… 
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)