Extremum problems on an infinite network

MaRDI QIDQ1224953zbMATH OpenFDO

Authors Maretsugu Yamasaki

Publication date 1975

Published in Hiroshima Mathematical Journal (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Programming involving graphs or networks (90C35)

Cited in

(8)

• Extremal length of an infinite network related to an accessible boundary point
• Discrete Dirichlet integral formula
• Maximization of input conductances of an infinite network
• On Gale's feasibility theorem for certain infinite networks
• Shortest paths in distance-regular graphs
• Hemivariational inequalities on graphs
• Semi-Fredholmness of the discrete Gauss-Bonnet operator
• On the p-torsional rigidity of combinatorial graphs

This page was built for publication: Extremum problems on an infinite network

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