Graphs with odd and even distances between non-cut vertices

DOI10.7494/opmath.2025.45.1.5MaRDI QIDQ6667285

Kateryna Antoshyna, Sergiy Kozerenko

Publication date: 20 January 2025

Published in: Opuscula Mathematica (Search for Journal in Brave)

zbMATH Keywords

blockline graphgraph distancenon-cut vertexstrong unique independence tree

Mathematics Subject Classification ID

Trees (05C05) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Gated sets in metric spaces
• Graphs with unique maximum independent sets
• Criterion for a graph to admit a good orientation in terms of leaf blocks
• A Characterization of Block-Graphs
• Congruent Graphs and the Connectivity of Graphs
• A Characterization of Certain Ptolemaic Graphs

This page was built for publication: Graphs with odd and even distances between non-cut vertices

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