On bipartite graphs having minimum fourth adjacency coefficient

DOI10.1007/S00373-022-02461-7zbMATH Open1485.05146OpenAlexW4220906787MaRDI QIDQ2117523FDOQ2117523

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)

Cites Work

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

Cited In (3)

• On the Number of All Substructures Containing at Most Four Edges
• On 4-Sachs optimal graphs
• \(C_4\)-saturated bipartite 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)