Q4944680 (Q4944680): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 14:47, 29 May 2024

scientific article; zbMATH DE number 1420225

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 1420225

Statements

scholarly article

0 references

zbMATH Open document ID

0 references

10.1002/(SICI)1097-0118(200001)33:1<1::AID-JGT1>3.0.CO;2-L

0 references

Peter Dankelmann

0 references

Roger Entringer

0 references

publication date

29 June 2000

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

spanning tree

0 references

average distance

0 references

minimum degree

0 references

MaRDI profile type

MaRDI publication profile

0 references

Computing the average distance of an interval graph

0 references

Average distance and independence number

0 references

Average distance and domination number

0 references

0 references

On the average Steiner distance of graphs with presribed properties

0 references

Mean distance in a graph

0 references

Radius, diameter, and minimum degree

0 references

The complexity of the network design problem

0 references

0 references

On the sum of all distances in a graph or digraph

0 references

On the sum of all distances in composite graphs

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4944680

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4944680&oldid=34239783"