Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 1
On distance preserving and sequentially distance preserving graphs
Jason P. Smith, Emad Zahedi
Izvirni znanstveni članek
Oznake: distance preserving;isometric subgraph;sequentially distance preserving;chordal;cut vertex;simplicial vertex;
A graph H is an isometric subgraph of G if d_H(u,v)=d_G(u,v), for every pair u,v ∈ V(H). A graph is distance preserving if it has an isometric subgraph of every possible order. A graph is sequentially distance preserving if its vertices can be ordered such that deleting the first i vertices results ...
Leto: 2025 Vir: Repozitorij Univerze na Primorskem (RUP)
Št. zadetkov: 1
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: