Characteristic polynomial of a graph¶

In spectral graph theory, the characteristic polynomial of a graph is the characteristic polynomial of its adjacency matrix.

Version: v1 · 2026-09-28 · History
Domain-specific #: 8413
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Spectral Graph Theory → Mathematics

Core Idea¶

Characteristic polynomial of a graph is treated here as the recurring mathematics_logic_statistics identity summarized by this source-grounded definition: In spectral graph theory, the characteristic polynomial of a graph is the characteristic polynomial of its adjacency matrix.

In linear algebra, the characteristic polynomial of a square matrix is a polynomial which is invariant under matrix similarity and has the eigenvalues as roots. It has the determinant and the trace of the matrix among its coefficients. The characteristic polynomial of an endomorphism of a finite-dimensional vector space is the characteristic polynomial of the matrix of that endomorphism over any basis (that is, the characteristic polynomial does not depend on the choice of a basis).

The characteristic equation, also known as the determinantal equation, is the equation obtained by equating the characteristic polynomial to zero. In spectral graph theory, the characteristic polynomial of a graph is the characteristic polynomial of its adjacency matrix. More precisely, suppose the transformation is represented by a square matrix A.

For Characteristic polynomial of a graph, the abstraction is narrower than the article's general subject matter: a positive case must preserve In spectral graph theory, the characteristic polynomial of a graph is the characteristic polynomial of its adjacency matrix. Retaining only the name, a familiar example, or a downstream effect is insufficient. The specialist roles and tests remain anchored in mathematics_logic_statistics, which is why this identity is domain-specific rather than prime.

How would you explain it like I'm…

Dot-and-Line Recipe

Draw some dots and connect some of them with lines, like a map of who is friends with whom. You can write a chart that says, for every pair of dots, whether they're connected. Mathematicians turn that chart into a special number recipe called the characteristic polynomial of the graph. It stays the same no matter how you name or number the dots.

The Graph's Special Polynomial

A graph is a set of dots (vertices) joined by lines (edges). Its adjacency matrix is a grid with a 1 where two dots are connected and a 0 where they aren't. From any square grid of numbers, you can build a polynomial called its characteristic polynomial, whose zeros are special numbers of the grid called eigenvalues. The characteristic polynomial of a graph is exactly that polynomial, built from the adjacency matrix. Renumbering the dots rearranges the grid but doesn't change the polynomial.

Adjacency Characteristic Polynomial

The adjacency matrix A of a graph with n vertices is an n-by-n table whose (i, j) entry records whether vertices i and j are joined. The characteristic polynomial of any square matrix is det(xI − A), a polynomial whose roots are the matrix's eigenvalues and whose coefficients include the trace and determinant. The characteristic polynomial of the graph is simply this polynomial for A. Relabeling vertices replaces A by a similar matrix, and similar matrices share a characteristic polynomial, so it is a property of the graph itself rather than of the numbering. Its roots are the graph's spectrum, the starting point of spectral graph theory.

In spectral graph theory the characteristic polynomial of a graph G on n vertices is p_G(x) = det(xI − A), with A the adjacency matrix. It inherits the properties of matrix characteristic polynomials: it's monic of degree n, invariant under matrix similarity, has the eigenvalues as roots, and includes the trace and determinant among its coefficients. Vertex relabeling acts by permutation similarity P A Pᵀ, so p_G is a graph invariant. Its roots are the adjacency spectrum of G. Note that the definition is tied specifically to the adjacency matrix; polynomials of other graph matrices (e.g. the Laplacian) are different objects.

Structural Signature¶

Sig role-phrases:

Defining carrier — More precisely, suppose the transformation is represented by a square matrix A.
Constitutive relation — The characteristic polynomial of A, denoted by p_A(t), is the polynomial defined by.
Operating condition — This trace may be computed as the sum of all principal minors of A of size k.
Recognition evidence — When the characteristic of the field of the coefficients is 0, each such trace may alternatively be computed as a single determinant, that of the k \times k matrix,.
Admissible variation — The Cayley–Hamilton theorem states that replacing t by A in the characteristic polynomial (interpreting the resulting powers as matrix powers, and the constant term c as c times the identity matrix) yields the zero matrix.
Characteristic consequence — To prove this, one may suppose n > m, by exchanging, if needed, A and B.
Failure boundary — The result follows from the case of square matrices, by comparing the characteristic polynomials of A^{\prime}B and AB.

What It Is Not¶

Not the whole field of mathematics_logic_statistics. The node requires the specific identity stated by In spectral graph theory, the characteristic polynomial of a graph is the characteristic polynomial of its adjacency matrix.
Not an over-broad reading. The converse however is not true in general: two matrices with the same characteristic polynomial need not be similar.
Not an over-broad reading. However, the assumption that p_A(t) has a factorization into linear factors is not always true, unless the matrix is over an algebraically closed field such as the complex numbers.
Not an over-broad reading. That polynomial differs from the one defined here by a sign (-1)^n, so it makes no difference for properties like having as roots the eigenvalues of A ; however the definition above always gives a monic polynomial, whereas the alternative definition is monic only when n is even.
Not automatically Integral graph. Retrieval proximity does not establish equivalence; the two identities must be compared by carrier, operation, and failure boundary.

Scope of Application¶

Characteristic polynomial of a graph applies literally inside mathematics_logic_statistics wherever the source-defined carrier and relation can be established. Its documented habitats include:

Secular function and secular equationSecular function. The term secular function has been used for what is now called characteristic polynomial (in some literature the term secular function is still used).
Secular equation. In molecular orbital calculations relating to the energy of the electron and its wave function it is also used instead of the characteristic equation.
Secular function and secular equationSecular function. The term comes from the fact that the characteristic polynomial was used to calculate secular perturbations (on a time scale of a century, that is, slow compared to annual motion) of planetary orbits, according to Lagrange's theory of oscillations.
Secular equation. In linear algebra it is sometimes used in place of characteristic equation.
1&t-0. Another example uses hyperbolic functions of a hyperbolic angle φ.
Motivation. More precisely, suppose the transformation is represented by a square matrix A.

Outside mathematics_logic_statistics, the name should be retained only when these same operational conditions survive; otherwise the comparison belongs to the broader parent Measurement or should be marked as analogy.

Clarity¶

A clear use of Characteristic polynomial of a graph names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is In spectral graph theory, the characteristic polynomial of a graph is the characteristic polynomial of its adjacency matrix. The strongest recognition evidence in the frozen account is: When the characteristic of the field of the coefficients is 0, each such trace may alternatively be computed as a single determinant, that of the k \times k matrix,. A report should distinguish that evidence from a proxy, consequence, or common implementation. It should also state the qualification The converse however is not true in general: two matrices with the same characteristic polynomial need not be similar. so that a reader can reproduce the classification rather than infer it from topical resemblance.

Manages Complexity¶

Characteristic polynomial of a graph compresses multiple mathematics_logic_statistics details into a stable diagnostic relation. The source shows both the central mechanism—the characteristic polynomial of A, denoted by p_A(t), is the polynomial defined by.—and the practical consequence—to prove this, one may suppose n > m, by exchanging, if needed, A and B. This compression makes cases comparable while leaving parameters, conventions, exceptions, and evidential quality explicit. It is lossy by design: local history and implementation details may be omitted only when they do not alter the defining relation.

Abstract Reasoning¶

Type the carrier. Identify the mathematics_logic_statistics entities to which the claim applies.
State the relation. Use the source-grounded identity: In spectral graph theory, the characteristic polynomial of a graph is the characteristic polynomial of its adjacency matrix.
Check operation and conditions. This trace may be computed as the sum of all principal minors of A of size k.
Demand recognition evidence. When the characteristic of the field of the coefficients is 0, each such trace may alternatively be computed as a single determinant, that of the k \times k matrix,.
Test variation. Change an implementation or setting while preserving the Cayley–Hamilton theorem states that replacing t by A in the characteristic polynomial (interpreting the resulting powers as matrix powers, and the constant term c as c times the identity matrix) yields the zero matrix.
Run the collapse test. Remove the defining operation; if the label still seems equally apt, only a topic or correlate was retained.
Reduce cautiously. When the specialist conditions cannot be carried, route the residual comparison to Measurement.

Knowledge Transfer¶

Within the home domain. Knowledge about Characteristic polynomial of a graph transfers literally when a new case preserves the same carrier type, relation, and recognition test. The term secular function has been used for what is now called characteristic polynomial (in some literature the term secular function is still used). In molecular orbital calculations relating to the energy of the electron and its wave function it is also used instead of the characteristic equation.

Beyond the home domain. No canonical parent is asserted for Characteristic polynomial of a graph. An outside case receives the specialist name only when the same typed roles and rejection conditions can be filled literally; otherwise the comparison remains an analogy pending later graph densification.

Examples¶

Canonical¶

In this case A is similar to a matrix in Jordan normal form. This case is canonical because it supplies a concrete carrier and lets the defining relation be checked rather than merely named.

Mapped back: carrier → the entities in the documented case; operation → In spectral graph theory, the characteristic polynomial of a graph is the characteristic polynomial of its adjacency matrix; recognition evidence → When the characteristic of the field of the coefficients is 0, each such trace may alternatively be computed as a single determinant, that of the k \times k matrix,

Applied / In Practice¶

The result follows from the case of square matrices, by comparing the characteristic polynomials of A^{\prime}B and AB. The applied case shows how the identity is used under a second setting or qualification while keeping the same operative relation.

Mapped back: changed setting → Characteristic polynomial of a product of two matrices; invariant → In spectral graph theory, the characteristic polynomial of a graph is the characteristic polynomial of its adjacency matrix; boundary → the case exits the class when the converse however is not true in general: two matrices with the same characteristic polynomial need not be similar

Structural Tensions¶

T1 — Stable identity versus admissible variation. The converse however is not true in general: two matrices with the same characteristic polynomial need not be similar. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Which changes preserve the defining relation, and which replace it?

T2 — Recognition versus proxy. However, the assumption that p_A(t) has a factorization into linear factors is not always true, unless the matrix is over an algebraically closed field such as the complex numbers. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the cited evidence establish the identity or only a correlated sign?

T3 — Definition versus implementation. That polynomial differs from the one defined here by a sign (-1)^n, so it makes no difference for properties like having as roots the eigenvalues of A ; however the definition above always gives a monic polynomial, whereas the alternative definition is monic only when n is even. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Is the observed implementation constitutive, optional, or merely common?

T4 — Scope versus overextension. (although the zero vector satisfies this equation for every \lambda, it is not considered an eigenvector). The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Can every claimed application fill the same typed roles without metaphor?

T5 — Transfer versus domain accent. More precisely, suppose the transformation is represented by a square matrix A. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: Does the receiving case instantiate Characteristic polynomial of a graph literally, co-instantiate Measurement, or only resemble it?

T6 — Autonomy versus reduction. The characteristic polynomial of A, denoted by p_A(t), is the polynomial defined by. The tension matters because emphasizing only one side either dissolves the identity or overstates what the evidence and domain conventions warrant.

Diagnostic: What does Characteristic polynomial of a graph distinguish that the broader parent Measurement leaves together?

Structural–Framed Character¶

Characteristic polynomial of a graph is structural-leaning. Its structural side is the repeatable organization summarized by In spectral graph theory, the characteristic polynomial of a graph is the characteristic polynomial of its adjacency matrix. Its framed side is the mathematics_logic_statistics vocabulary that fixes the carrier, evidence, exceptions, and admissible transformations.

Evaluative weight: the identity can be stated descriptively even when applications carry practical stakes. Human-practice dependence: the source-grounded carrier determines whether the relation exists independently or is constituted by a practice. Institutional origin: disciplinary conventions stabilize the name and test. Vocabulary portability: This trace may be computed as the sum of all principal minors of A of size k. Import versus recognition: literal transfer requires the same mechanism; shape alone is analogy.

Its portable skeleton is Measurement. Its character: a recurring specialist identity whose thin organization can be abstracted, while its operational meaning remains domain-bound.

Structural Core vs. Domain Accent¶

What is skeletal. In spectral graph theory, the characteristic polynomial of a graph is the characteristic polynomial of its adjacency matrix. The stable skeleton is the typed relation expressed in that definition and the entry's recognition and collapse tests. The source identifies these operative conditions: More precisely, suppose the transformation is represented by a square matrix A. The characteristic polynomial of A, denoted by pA(t), is the polynomial defined by. It further constrains recognition and variation through: This trace may be computed as the sum of all principal minors of A of size k. When the characteristic of the field of the coefficients is 0, each such trace may alternatively be computed as a single determinant, that of the k \times k matrix,.

What is domain-bound. mathematics logic statistics supplies the operative entities, technical vocabulary, warrants, and exceptions that make Characteristic polynomial of a graph literal. Its documented scope includes the condition that The term secular function has been used for what is now called characteristic polynomial (in some literature the term secular function is still used). Another bounded application condition is that In molecular orbital calculations relating to the energy of the electron and its wave function it is also used instead of the characteristic equation. These are not decorative examples; they determine which carrier and evidence can fill the abstraction's roles.

Why no parent is asserted. Removing those specialist details does not currently yield one live catalog node that is a necessary genus for every instance. The entry is therefore approved as unparented rather than attached by topical resemblance. Its collapse evidence remains specific—The Cayley–Hamilton theorem states that replacing t by A in the characteristic polynomial (interpreting the resulting powers as matrix powers, and the constant term c as c times the identity matrix) yields the zero matrix.—and future graph densification may discover a defensible relation only if it preserves that boundary.

This entry is a kind of Graph Invariant and is a kind of Polynomial.

Approved unparented node. No current live node supplies a defensible necessary genus or structural prerequisite for Characteristic polynomial of a graph. The reviewed identity is: In spectral graph theory, the characteristic polynomial of a graph is the characteristic polynomial of its adjacency matrix. The accelerated suggestion was declined because topical or lexical similarity does not establish hierarchy; the node is admitted without a parent pending later graph densification.
Related reasoning operations. Evidence, representation, comparison, classification, transformation, or evaluation may participate in particular cases, but participation does not make any one of them a necessary parent of every instance.

Relationships to Other Abstractions¶

Current abstraction Characteristic polynomial of a graph Domain-specific

Parents (2) — more general patterns this builds on

Characteristic polynomial of a graph is a kind of Graph Invariant Domain-specific

Characteristic polynomial of a graph satisfies the defining boundary of Graph Invariant: A graph invariant is a value, polynomial, sequence, multiset, or other mathematical object assigned to a graph such that isomorphic graphs receive the same result, with its definition, graph category, and distinguishing power explicitly stated.
Characteristic polynomial of a graph is a kind of Polynomial Domain-specific

It is the polynomial obtained from the adjacency matrix characteristic polynomial.

Hierarchy paths (2) — routes to 2 parentless roots

Characteristic polynomial of a graph → Graph Invariant

Show alternative path (1)

Neighborhood in Abstraction Space¶

Characteristic polynomial of a graph sits in a moderately populated region (44^th percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Polynomials & Algebraic Invariants (20 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08

Not to Be Confused With¶

Measurement. The parent omits the specialist differentia. Tell: Can the case establish In spectral graph theory, the characteristic polynomial of a graph is the characteristic polynomial of its adjacency matrix?
Integral graph. A finite graph whose adjacency matrix has only integer eigenvalues. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Determinant. Map a square matrix or finite-dimensional endomorphism to the unique normalized alternating multilinear scalar that tracks invertibility, oriented volume scaling, and composition multiplicatively. Tell: Which entry's carrier, operation, and failure condition are satisfied?
Transfer matrix. The block-Toeplitz linear operator induced by a refinement mask whose eigenstructure characterizes refinable functions and their regularity. Tell: Which entry's carrier, operation, and failure condition are satisfied?
A measurement, proxy, or consequence. Those may provide evidence without being the identity. Tell: Would Characteristic polynomial of a graph remain present if the detector or downstream effect changed?
A metaphorical analogue. A similar shape outside mathematics_logic_statistics lacks the specialist mechanism. Tell: Do the native roles transfer literally, or only the parent Measurement?

References¶

Frozen Wikipedia discovery revision: https://en.wikipedia.org/wiki/Characteristic_polynomial (revision 1361084025).
Preserved source candidate: https://archive.org/details/introductorycirc0000guil
Preserved source candidate: https://www.ams.org/journals/mcom/1952-06-037/S0025-5718-1952-0048162-0/S0025-5718-1952-0048162-0.pdf
Preserved source candidate: https://projecteuclid.org/journals/bulletin-of-the-american-mathematical-society/volume-52/issue-2/On-the-zeros-of-polynomials-with-complex-coefficients/bams/1183507703.pdf
Preserved source candidate: http://mathworld.wolfram.com/CharacteristicPolynomial.html
Preserved source candidate: https://archive.org/details/springer_10.1007-978-1-4757-2178-2
Preserved source candidate: https://archive.org/details/springer_10.1007-978-1-4757-2178-2/page/n142
Preserved source candidate: https://www.math.ucla.edu/~tao/resource/general/115a.3.02f/week8.pdf
Preserved source candidate: http://dict.die.net/secular%20equation/

The frozen Wikipedia revision is discovery provenance. The retained source set was reviewed for identity, formal or operational relation, and scope. The encyclopedia's structural synthesis is bounded to those claims; a thin authority surface is recorded as a nonblocking source-strengthening repair rather than concealed.