Characterization of n-path graphs and of graphs having \(n\)-th root

DOI10.1016/0095-8956(74)90074-4zbMath0268.05118OpenAlexW2037791997MaRDI QIDQ2562796

F. Escalante, Teresa Rojano, Luis Montejano

Publication date: 1974

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(74)90074-4

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)

Related Items (13)

Switching invariant two-path signed graphs ⋮ Nonnegative square roots of matrices ⋮ Computing roots of graphs is hard ⋮ Negation switching invariant 3-Path signed graphs ⋮ Iterated open neighborhood graphs and generalizations ⋮ Connected triangle-free \(m\)-step competition graphs ⋮ A bibliography of graph equations ⋮ A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph ⋮ Spectral analysis of t-path signed graphs ⋮ Applications of edge coverings by cliques ⋮ The \(m\)-step competition graph of a digraph ⋮ A characterization of competition graphs ⋮ Linear-time algorithms for tree root problems

Cites Work

• Unnamed Item
• Unnamed Item
• The square root of a graph
• The square root of a digraph
• Characterizations of derived graphs

This page was built for publication: Characterization of n-path graphs and of graphs having \(n\)-th root