File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1080/0020739930240302
- Scopus: eid_2-s2.0-84946314104
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: On maximal and minimal triangular planar graph: an optimization approach
| Title | On maximal and minimal triangular planar graph: an optimization approach |
|---|---|
| Authors | |
| Issue Date | 1993 |
| Publisher | Taylor & 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? |
| Abstract | A 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 Identifier | http://hdl.handle.net/10722/75185 |
| ISSN | 2023 Impact Factor: 0.7 2023 SCImago Journal Rankings: 0.634 |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Chu, SCK | en_HK |
| dc.date.accessioned | 2010-09-06T07:08:45Z | - |
| dc.date.available | 2010-09-06T07:08:45Z | - |
| dc.date.issued | 1993 | en_HK |
| dc.identifier.citation | International Journal of Mathematical Education in Science and Technology, 1993, v. 24 n. 3, p. 337-348 | en_HK |
| dc.identifier.issn | 0020-739X | en_HK |
| dc.identifier.uri | http://hdl.handle.net/10722/75185 | - |
| dc.description.abstract | A 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.language | eng | en_HK |
| dc.publisher | Taylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/0020739X.asp | en_HK |
| dc.relation.ispartof | International Journal of Mathematical Education in Science and Technology | en_HK |
| dc.title | On maximal and minimal triangular planar graph: an optimization approach | en_HK |
| dc.type | Article | en_HK |
| dc.identifier.openurl | http://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+approach | en_HK |
| dc.identifier.email | Chu, SCK: schu@hku.hk | en_HK |
| dc.identifier.authority | Chu, SCK=rp00685 | en_HK |
| dc.identifier.doi | 10.1080/0020739930240302 | - |
| dc.identifier.scopus | eid_2-s2.0-84946314104 | - |
| dc.identifier.hkuros | 35563 | en_HK |
| dc.identifier.issnl | 0020-739X | - |