Upper Bound for the Energy of Strongly Connected Digraphs

Applicable Analysis and Discrete Mathematics - Serbia
doi 10.2298/aadm101121030a
Full Text
Abstract

Available in full text

Date
Authors
Publisher

National Library of Serbia

Related search

New Method for Measuring the Anchoring Energy of Strongly-Bound Membrane-Associated Proteins

Biophysical Journal
Biophysics
2016English

Minimally Strong Subgraph (K,l)-Arc-Connected Digraphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2020English

New Upper Bound for the High-Energy Scattering Amplitude at Fixed Angle

Physical Review Letters
AstronomyPhysics
1963English

On Bounds for the Energy of Graphs and Digraphs

Contemporary Mathematics
Mathematics
2018English

Strongly Regular M-Cayley Circulant Graphs and Digraphs

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2014English

On the Extremal Energy of Bicyclic Digraphs

Journal of Mathematical Inequalities
Analysis
2015English

The Perfluoropolymer Upper Bound

AICHE Journal
BiotechnologyEnvironmental EngineeringChemical Engineering
2019English

How to Make a Strongly Connected Digraph Two-Connected

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1995English

A Lower Bound on Cycle-Finding in Sparse Digraphs

2020English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy