Distant Sum Distinguishing Index of Graphs With Bounded Minimum Degree

Ars Mathematica Contemporanea - Slovenia
doi 10.26493/10.26493/1855-3974.1496.623
Full Text
Abstract

Available in full text

Date
Authors
Publisher

University of Primorska Press

Related search

Sparse Universal Graphs for Bounded-Degree Graphs

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

Testing Expansion in Bounded-Degree Graphs

2007English

Optimal Pebbling Number of Graphs With Given Minimum Degree

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs

SIAM Journal on Computing
MathematicsComputer Science
2009English

Delay Performance of CSMA in Networks With Bounded Degree Conflict Graphs

2011English

Minimum Activation Cost Node-Disjoint Paths in Graphs With Bounded Treewidth

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Some Results on the Reciprocal Sum-Degree Distance of Graphs

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2013English

Distance Approximation in Bounded-Degree and General Sparse Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

On the Number of Connected Sets in Bounded Degree Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy