Amanote Research

Amanote Research

    RegisterSign In

On the Distance Function of a Connected Graph

Czechoslovak Mathematical Journal - United States
doi 10.1007/s10587-008-0072-1
Full Text
Open PDF
Abstract

Available in full text

Categories
Mathematics
Date

December 1, 2008

Authors
Ladislav Nebeský
Publisher

Institute of Mathematics, Czech Academy of Sciences


Related search

On the Complexity of Partitioning a Graph Into a Few Connected Subgraphs

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

Three Connected Domination in a Graph

International Journal for Research in Applied Science and Engineering Technology
2019English

Secure Connected Domination in a Graph

International Journal of Mathematical Analysis
2014English

Research on Some Conclusions of the Distance Spectrum of a Graph

2016English

The Upper Connected Edge Geodetic Number of a Graph

Filomat
Mathematics
2012English

The Upper Connected Vertex Detour Number of a Graph

Filomat
Mathematics
2012English

Inverse and Disjoint Connected Cototal Domination Number of the Jump Graph of a Graph

International Journal of Research in Advent Technology
2019English

The Minimum Monopoly Distance Energy of a Graph

International Journal of Computer Applications
2015English

The Graph Distance Game and Some Graph Operations

Electronic Notes in Discrete Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy