Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Selvaraj Balachandran
Upper Bound for the Energy of Strongly Connected Digraphs
Applicable Analysis and Discrete Mathematics
Combinatorics
Applied Mathematics
Analysis
Discrete Mathematics
Related publications
New Method for Measuring the Anchoring Energy of Strongly-Bound Membrane-Associated Proteins
Biophysical Journal
Biophysics
Minimally Strong Subgraph (K,l)-Arc-Connected Digraphs
Discussiones Mathematicae - Graph Theory
Combinatorics
Applied Mathematics
Discrete Mathematics
New Upper Bound for the High-Energy Scattering Amplitude at Fixed Angle
Physical Review Letters
Astronomy
Physics
On Bounds for the Energy of Graphs and Digraphs
Contemporary Mathematics
Mathematics
Strongly Regular M-Cayley Circulant Graphs and Digraphs
Ars Mathematica Contemporanea
Algebra
Combinatorics
Number Theory
Geometry
Discrete Mathematics
Theoretical Computer Science
Topology
On the Extremal Energy of Bicyclic Digraphs
Journal of Mathematical Inequalities
Analysis
The Perfluoropolymer Upper Bound
AICHE Journal
Biotechnology
Environmental Engineering
Chemical Engineering
How to Make a Strongly Connected Digraph Two-Connected
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Lower Bound on Cycle-Finding in Sparse Digraphs