On bipartite graphs having minimum fourth adjacency coefficient

DOI10.1007/S00373-022-02461-7MaRDI QIDQ2117523zbMATHOpenAlexFDO

Authors 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)

Recommendations

• On 4-Sachs optimal graphs
• Optimal graphs for chromatic polynomials
• On the Laplacian coefficients of bipartite bicyclic graphs
• Graphs with fourth Laplacian eigenvalue less than two
• The Seidel polynomial and spectrum of the complete 4-partite graphs

Cites work

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

Cited in

(4)

• On the number of all substructures containing at most four edges
• \(C_4\)-saturated bipartite graphs
• Optimizing Colin de Verdière matrices of \(K_{4,4}\)
• On 4-Sachs optimal graphs

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

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