BINDING NUMBER AND MINIMUM DEGREE FOR FRACTIONAL (K,m)-Deleted GRAPHS

Bulletin of the Australian Mathematical Society - United Kingdom
doi 10.1017/s0004972711002784
Full Text
Abstract

Available in full text

Categories
Mathematics
Date
Authors
Publisher

Cambridge University Press (CUP)

Related search

A Result on Fractional $K$-Deleted Graphs

Mathematica Scandinavica
Mathematics
2010English

Optimal Pebbling Number of Graphs With Given Minimum Degree

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Minimum Degree, Leaf Number and Traceability

Czechoslovak Mathematical Journal
Mathematics
2013English

Minimum Degree and Size Conditions for Hamiltonian and Traceable Graphs

Fundamental Journal of Mathematics and Applications
2018English

Degree-Associated Reconstruction Number of Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2010English

The Fractional K-Metric Dimension of Graphs

Applicable Analysis and Discrete Mathematics
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2019English

Distant Sum Distinguishing Index of Graphs With Bounded Minimum Degree

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2019English

The Independence Number in Graphs of Maximum Degree Three

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2008English

Polynomial-Time Approximation Scheme for Minimum K-Cut in Planar and Minor-Free Graphs

2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy