Publication | Open Access
Computing the weighted Wiener and Szeged number on weighted cactus graphs in linear time
26
Citations
0
References
2003
Year
EngineeringNetwork AnalysisEducationComputational ComplexityLinear AlgorithmsRandom GraphStructural Graph TheoryWeighted Cactus GraphsDiscrete MathematicsCombinatorial OptimizationProbabilistic Graph TheoryApproximation TheoryGeometric Graph TheoryLinear TimeAlgebraic Graph TheoryComputer ScienceGraph AlgorithmNetwork ScienceGraph TheoryExtremal Graph TheoryWeighted Wiener
Cactus is a graph in which every edge lies on at most one cycle. Linear algorithms for computing the weighted Wiener and Szeged numbers on weighted cactus graphs are given. Graphs with weighted vertices and edges correspond to molecular graphs with heteroatoms.