Amanote Research

Amanote Research

    RegisterSign In

Closed K-Stop Distance in Graphs

Discussiones Mathematicae - Graph Theory - Poland
doi 10.7151/dmgt.1563
Full Text
Open PDF
Abstract

Available in full text

Categories
CombinatoricsApplied MathematicsDiscrete Mathematics
Date

January 1, 2011

Authors
Grady BullingtonLinda ErohRalucca GeraSteven J. Winters
Publisher

Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Gora


Related search

Closed Orders and Closed Graphs

Analele Stiintifice ale Universitatii Ovidius Constanta, Seria Matematica
Applied MathematicsAnalysis
2016English

Monophonic Distance in Graphs

2018English

On Closed Graphs, II

Involve, a Journal of Mathematics
2016English

Degree Distance of Unicyclic Graphs

Filomat
Mathematics
2010English

On Minimal Topological Totally Closed Graphs

Annals of Pure and Applied Mathematics
2018English

Distance Graphs on the Integers

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2005English

Book Review: Distance-Regular Graphs

Bulletin of the American Mathematical Society
MathematicsApplied Mathematics
1991English

Maximal K-Independent Sets in Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2008English

Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy