Optimal Pebbling Number of the Square Grid

Graphs and Combinatorics - Japan
doi 10.1007/s00373-020-02154-z
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Optimal Pebbling Number of Graphs With Given Minimum Degree

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Optimal Number of Replicas in Data Grid Environment

2008English

Optimal Pebbling and Rubbling of Graphs With Given Diameter

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Analysis and Possibility of Modification of Available Algorithms for Finding the Optimal Path on a Square Grid Using Parallel Programming Methods

Actual problems of automation and information technology
2018English

Study of Cancer Mortality by Grid Square Method

Environmental Health Perspectives
MutagenesisPublic HealthEnvironmentalHealthToxicologyOccupational Health
1979English

Exact Minimum Density of Codes Identifying Vertices in the Square Grid

SIAM Journal on Discrete Mathematics
Mathematics
2005English

The Complexity of Pebbling in Diameter Two Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2012English

On the 2-Domination Number of Complete Grid Graphs

Open Journal of Discrete Mathematics
2017English

Optimal Partitioning of a Square: A Numerical Approach

ScienceAsia
Multidisciplinary
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy