DOIAbstract
AbstractThe counting series for homeomorphically irreducible labelled graphs is given. A linear recurrence equation is obtained to facilitate the tabulation of the number of such graphs on a specified number of vertices
AbstractThe counting series for homeomorphically irreducible labelled graphs is given. A linear recurrence equation is obtained to facilitate the tabulation of the number of such graphs on a specified number of vertices
Given a digraph G, we propose a new method to find the recurrence equation for the number of vertice...
AbstractWe count labeled acyclic digraphs according to the number sources, sinks, and edges
Exhaustive catalogs of graphs can be an indispensable tool for computerized investigations in graph-...
AbstractThe counting series for homeomorphically irreducible labelled graphs is given. A linear recu...
[Abstract] This paper considers figures with vertices and edges as components, and discusses how man...
AbstractLabelled three-connected graphs and labelled two-connected graphs with no vertices of degree...
AbstractConstructive combinatorial proofs are given for recurrence formulas which count, respectivel...
AbstractRecursive procedures are obtained for counting isomorphism classes of three-connected graphs...
Let Hn be the number of claw-free cubic graphs on 2n labeled nodes. Combinatorial reductions are use...
AbstractRecurrence rules are derived for enumerating the linked diagrams first encountered by Toucha...
AbstractAlgebraic inversion of cycle index sum relations is employed to derive new algorithms for co...
AbstractAlgebraic inversion of cycle index sum relations is employed to derive new algorithms for co...
summary:The paper brings explicit formula for enumeration of vertex-labeled split graphs with given ...
AbstractAn irreducible (point-determining) graph is one in which distinct vertices have distinct nei...
AbstractFor a graph G, a graph recurrence sequence x0,x1,x2,… of vectors is defined by the recurrenc...
Given a digraph G, we propose a new method to find the recurrence equation for the number of vertice...
AbstractWe count labeled acyclic digraphs according to the number sources, sinks, and edges
Exhaustive catalogs of graphs can be an indispensable tool for computerized investigations in graph-...
AbstractThe counting series for homeomorphically irreducible labelled graphs is given. A linear recu...
[Abstract] This paper considers figures with vertices and edges as components, and discusses how man...
AbstractLabelled three-connected graphs and labelled two-connected graphs with no vertices of degree...
AbstractConstructive combinatorial proofs are given for recurrence formulas which count, respectivel...
AbstractRecursive procedures are obtained for counting isomorphism classes of three-connected graphs...
Let Hn be the number of claw-free cubic graphs on 2n labeled nodes. Combinatorial reductions are use...
AbstractRecurrence rules are derived for enumerating the linked diagrams first encountered by Toucha...
AbstractAlgebraic inversion of cycle index sum relations is employed to derive new algorithms for co...
AbstractAlgebraic inversion of cycle index sum relations is employed to derive new algorithms for co...
summary:The paper brings explicit formula for enumeration of vertex-labeled split graphs with given ...
AbstractAn irreducible (point-determining) graph is one in which distinct vertices have distinct nei...
AbstractFor a graph G, a graph recurrence sequence x0,x1,x2,… of vectors is defined by the recurrenc...
Given a digraph G, we propose a new method to find the recurrence equation for the number of vertice...
AbstractWe count labeled acyclic digraphs according to the number sources, sinks, and edges
Exhaustive catalogs of graphs can be an indispensable tool for computerized investigations in graph-...
Add to ORKG