The neighborhood inclusion structure of a graph

DOI10.1016/0895-7177(93)90248-WzbMath0795.05119OpenAlexW2027278805MaRDI QIDQ1310225

Frank Harary, Ralph Tindell, F. T. Boesch, Charles L. Suffel

Publication date: 11 September 1994

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(93)90248-w

zbMATH Keywords

inclusion mixed graphneighborhood reductionreduced inclusion digraphtreshold graphvertex neighborhoods

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items (9)

On the recognition of neighborhood inclusion posets ⋮ Graphs whose adjacency matrices have rank equal to the number of distinct nonzero rows ⋮ Theorems on partitioned matrices revisited and their applications to graph spectra ⋮ Graphs of fixed order and size with maximal \(A_\alpha\)-index ⋮ Connected graphs of fixed order and size with maximal \(A_\alpha \)-index: the one-dominating-vertex case ⋮ Unoriented Laplacian maximizing graphs are degree maximal ⋮ Connected graphs with maximal \(Q\)-index: The one-dominating-vertex case ⋮ Graphs with maximal signless Laplacian spectral radius ⋮ On the reduced signless Laplacian spectrum of a degree maximal graph

Cites Work

• Unnamed Item
• The spanning subgraphs of eulerian graphs
• Graphs with maximal number of adjacent pairs of edges
• The number of spanning trees in a prism

This page was built for publication: The neighborhood inclusion structure of a graph