scientific article; zbMATH DE number 3497930
From MaRDI portal
Publication:4079637
zbMATH Open0318.05115MaRDI QIDQ4079637FDOQ4079637
Publication date: 1975
Title of this publication is not available (Why is that?)
Cited In (59)
- Super Edge-Connected Linear Hypergraphs
- On the spectrum of linear dependence graph of a finite dimensional vector space
- On skeletons, diameters and volumes of metric polyhedra
- On the minimum degree of power graphs of finite nilpotent groups
- Zero-divisor super-\(\lambda\) graphs
- Graphs from matrices - a survey
- Title not available (Why is that?)
- On the distance connectivity of graphs and digraphs
- On the degrees of a strongly vertex-magic graph
- Radius-edge-invariant and diameter-edge-invariant graphs
- A maximum degree theorem for diameter-2-critical graphs
- A characterization of diameter-2-critical graphs with no antihole of length four
- Equiarboreal graphs
- Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
- Edge-connectivity in hypergraphs
- Maximally edge-connected graphs and zeroth-order general Randić index for \(0<\alpha <1\)
- The connected cutset connectivity of a graph
- On a conjecture of Murty and Simon on diameter two critical graphs. II.
- A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- On the existence of \(k\)-partite or \(K_p\)-free total domination edge-critical graphs
- Sufficient conditions for hypergraphs to be maximally edge-connected
- On the enhanced power graph of a finite group
- Codes from incidence matrices of graphs
- A characterization of \(P_5\)-free, diameter-2-critical graphs
- On diameter 2-critical graphs
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Local-edge-connectivity in digraphs and oriented graphs
- Inverse degree and edge-connectivity
- On the edge-connectivity and restricted edge-connectivity of a product of graphs
- Some Recent Results on the Graphs of Finite-Dimensional Vector Spaces
- Constructing goal-minimally \(k\)-diametric graphs by lifts
- Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs
- A characterization of diameter-2-critical graphs whose complements are diamond-free
- Bipartite graphs and digraphs with maximum connectivity
- Star complements and edge-connectivity in finite graphs
- Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\)
- On a conjecture of Murty and Simon on diameter 2-critical graphs
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- On graphs with equal edge connectivity and minimum degree
- Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
- Maximal and minimal vertex-critical graphs of diameter two
- On nonzero component graph of vector spaces over finite fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey
- Large fault-tolerant interconnection networks
- On the minimum degree, edge-connectivity and connectivity of power graphs of finite groups
- Maximally edge-connected hypergraphs
- Triangle-free projective-planar graphs with diameter two: domination and characterization
- Diameter-vital edges in a graph
- The connectivity of a graph and its complement
- On super edge-connectivity of product graphs
- On the connectivity of visibility graphs
- Diameter critical graphs
- Neighborhood conditions for graphs to be super restricted edge connected
- Minimum degree, edge-connectivity and radius
- On clique numbers of colored mixed graphs
- Minimum edge cuts in diameter 2 graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4079637)
