scientific article; zbMATH DE number 5003360

MaRDI QIDQ3369845zbMATH OpenFDO

Authors Hirobumi Mizuno, Iwao Sato

Publication date 6 February 2006

zbMATH Keywords

complexityLaplacian matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Determinants, permanents, traces, other special matrix functions (15A15)

Recommendations

• On the cover polynomial of a digraph
• On the tree cover number of a graph
• On the degree-chromatic polynomial of a tree
• On the degree-chromatic polynomial of a tree
• On the tree number of regular graphs
• On the edge cover polynomial of certain graphs
• On the edge cover polynomial of a graph
• On covering vertices of a graph by trees
• On the roots of edge cover polynomials of graphs
• On the characteristic polynomials of covering number of vertices and edges of graphs

Cited in

(5)

• On the tree number of regular graphs
• The \(m\)-path cover polynomial of a graph and a model for general coefficient linear recurrences
• On the tree cover number of a graph
• Structure Polynomials and Subgraphs of Rooted Regular Trees
• Characteristic polynomials of graph coverings

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3369845)