On bipartite graphs having minimum fourth adjacency coefficient

DOI10.1007/s00373-022-02461-7zbMath1485.05146OpenAlexW4220906787MaRDI QIDQ2117523

Yanyan Li

Publication date: 21 March 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-022-02461-7

zbMATH Keywords

matchingcharacteristic polynomialpartitions of positive integersSachs subgraphYoung matrix

Mathematics Subject Classification ID

Graph polynomials (05C31) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

On the Number of All Substructures Containing at Most Four Edges ⋮ On 4-Sachs optimal graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs with the fewest matchings
• On bounds for the index of double nested graphs
• Graphs for which the least eigenvalue is minimal. II.
• Counting paths in Young's lattice
• On a Ramsey-Turán type problem
• No threshold graphs are cospectral
• Threshold graphs and related topics
• On a poset of trees revisited
• The characteristic polynomial of a graph
• \(C_{3}\) saturated graphs
• The Complexity of the Partial Order Dimension Problem
• Saturated graphs with minimal number of edges
• Algebraic Graph Theory
• On the rank of a real skew symmetric matrix described by an oriented graph
• Tridiagonal matrices and spectral properties of some graph classes
• Combinatorial Matrix Theory
• Difference graphs

This page was built for publication: On bipartite graphs having minimum fourth adjacency coefficient