File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: On maximal and minimal triangular planar graph: an optimization approach

TitleOn maximal and minimal triangular planar graph: an optimization approach
Authors
Issue Date1993
PublisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/0020739X.asp
Citation
International Journal of Mathematical Education in Science and Technology, 1993, v. 24 n. 3, p. 337-348 How to Cite?
AbstractA triangular planar graph (TPG) is defined to be a connected simple planar graph with every edge being a side of some triangle. Given a fixed number of nodes, a maximal (respectively minimal) TPG is a TPG that has a maximum (respectively minimum) possible number of edges. Here we suggest a novel idea of constructively characterizing a minimal TPG by way of a simple integer optimization formulation, which leads readily to solutions as well as generalizations for planar graphs with edges being sides of polygons. Simple results for the easier problem of maximal TPG are also provided.
Persistent Identifierhttp://hdl.handle.net/10722/75185
ISSN
2015 SCImago Journal Rankings: 0.365

 

DC FieldValueLanguage
dc.contributor.authorChu, SCKen_HK
dc.date.accessioned2010-09-06T07:08:45Z-
dc.date.available2010-09-06T07:08:45Z-
dc.date.issued1993en_HK
dc.identifier.citationInternational Journal of Mathematical Education in Science and Technology, 1993, v. 24 n. 3, p. 337-348en_HK
dc.identifier.issn0020-739Xen_HK
dc.identifier.urihttp://hdl.handle.net/10722/75185-
dc.description.abstractA triangular planar graph (TPG) is defined to be a connected simple planar graph with every edge being a side of some triangle. Given a fixed number of nodes, a maximal (respectively minimal) TPG is a TPG that has a maximum (respectively minimum) possible number of edges. Here we suggest a novel idea of constructively characterizing a minimal TPG by way of a simple integer optimization formulation, which leads readily to solutions as well as generalizations for planar graphs with edges being sides of polygons. Simple results for the easier problem of maximal TPG are also provided.-
dc.languageengen_HK
dc.publisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/0020739X.aspen_HK
dc.relation.ispartofInternational Journal of Mathematical Education in Science and Technologyen_HK
dc.titleOn maximal and minimal triangular planar graph: an optimization approachen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0020-739X&volume=24 No3&spage=337&epage=348&date=1993&atitle=On+maximal+and+minimal+triangular+planar+graph:+an+optimization+approachen_HK
dc.identifier.emailChu, SCK: schu@hku.hken_HK
dc.identifier.authorityChu, SCK=rp00685en_HK
dc.identifier.doi10.1080/0020739930240302-
dc.identifier.hkuros35563en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats