Optimal Pebbling Number of Graphs With Given Minimum Degree

Discrete Applied Mathematics - Netherlands
doi 10.1016/j.dam.2019.01.023
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Optimal Pebbling and Rubbling of Graphs With Given Diameter

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

The Number of Spanning Trees in Graphs With a Given Degree Sequence

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
1995English

Optimal Pebbling Number of the Square Grid

Graphs and Combinatorics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2020English

Generating Maximally Disassortative Graphs With Given Degree Distribution

Stochastic Systems
2018English

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

Bulletin of the Australian Mathematical Society
Mathematics
2011English

Spectral Radius of Graphs With Given Matching Number

Linear Algebra and Its Applications
Numerical AnalysisAlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTopology
2007English

Giant Component in Random Multipartite Graphs With Given Degree Sequences

Stochastic Systems
2015English

Towards Random Uniform Sampling of Bipartite Graphs With Given Degree Sequence

Electronic Journal of Combinatorics
CombinatoricsApplied MathematicsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2013English

Distant Sum Distinguishing Index of Graphs With Bounded Minimum Degree

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy