Eigenvector-based identification of bipartite subgraphs

DOI10.1016/j.dam.2019.03.028zbMath1423.05093arXiv1806.01711OpenAlexW2963250541MaRDI QIDQ2328104

Dragan Stevanović, Debdas Paul

Publication date: 9 October 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.01711

zbMATH Keywords

eigenvectorscomplex networksbipartite subgraphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the eigenvectors belonging to the minimum eigenvalue of an essentially nonnegative symmetric matrix with bipartite graph
• Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality
• Network bipartivity and the transportation efficiency of European passenger airlines
• Estimating the Estrada index
• Bipartite structure of all complex networks
• On some extremal problems in graph theory
• .879-approximation algorithms for MAX CUT and MAX 2SAT
• Highly Bi-Connected Subgraphs for Computational Protein Function Annotation
• Emergence of Scaling in Random Networks
• Economic Networks: The New Challenges
• The Laplacian Spectrum of a Graph
• Random Plane Networks
• Random Geometric Graphs
• Random graph models of social networks
• Error Correction Coding
• Collective dynamics of ‘small-world’ networks
• Some optimal inapproximability results
• Probability and Computing
• Some Extremal Properties of Bipartite Subgraphs

This page was built for publication: Eigenvector-based identification of bipartite subgraphs