Computational and structural analysis of the contour of graphs

DOI10.1111/ITOR.12290zbMATH Open1395.05094OpenAlexW2337819924MaRDI QIDQ5374524FDOQ5374524

Authors: Danilo Artigas, Simone Dantas, Alonso L. S. Oliveira, Thiago M. D. Silva 

Publication date: 14 September 2018

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12290

Recommendations

• On the contour of graphs
• On the geodeticity of the contour of a graph
• On the geodetic iteration number of the contour of a graph
• On the contour of bipartite graphs
• The contour of a bridged graph is geodetic

zbMATH Keywords

convexitycontourgeodetic setbipartite graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Paths and cycles (05C38) Connectivity (05C40)

Cited In (10)

• The contour of a bridged graph is geodetic
• On the geodeticity of the contour of a graph
• On the geodetic iteration number of the contour of a graph
• On the contour of bipartite graphs
• Leanness computation: small values and special graph classes
• Theoretical Analysis of Active Contours on Graphs
• Geodeticity of the contour of chordal bipartite graphs
• On the contour of graphs
• New results of the geodeticity of the contour of a graph
• Title not available (Why is that?)

This page was built for publication: Computational and structural analysis of the contour of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5374524)