See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/337945210

GRAPH THEORY AND ARCHITECTURE

Article  in  MATHEMATICAL SCIENCES RESEARCH JOURNAL · December 2019

CITATION READS

1 1,987

3 authors, including:

Madhu Mathi
VIT University
12 PUBLICATIONS   49 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Thermal performance of buildings View project

Urban Green Infrastructure : Planning for Sustainable and Climate Resilient Urban environments. View project

All content following this page was uploaded by Madhu Mathi on 16 December 2019.

The user has requested enhancement of the downloaded file.

Mathematical Sciences International Research Journal Volume 6 Spl Issue ISSN 2278-8697

GRAPH THEORY AND ARCHITECTURE

L. Lakshmi
Student, Department of architecture, Thiagarajar college of Engineering
Madurai, Tamil Nadu , India.
A. Madhumathi
Faculty of Architecture, Department of Architecture, Thiagarajar College of Engineering
Madurai, Tamil Nadu , India
M. Sindhuja
Faculty of Architecture, Department of Architecture, Thiagarajar College of Engineering
Madurai, Tamil Nadu , India

Abstract: Today, the link between architecture and digital software is so strong; it’s easy to forget that it hasn’t
always been this way. Architecture’s reliance on digital design programs has lead to the spread of a
homogenous ‘global-style’ architecture — buildings made from the same material, designed by the same
methods, using the same software, all over the world. By contrast to this homogeneous global style
architecture, this research would provide quite a different approach to architectural design process. This paper
presents a research on mathematical models, methods, and techniques for analysis, and evaluation of spatial
configurations in architectural and urban design and built forms. In this research, graph theory is used to
mathematically model spatial configurations in order to provide intuitive ways of studying and designing
spatial arrangements for architects and urban designers and used to mathematically model architectural forms
from its evolution. Primarily aims to present possible analytical approaches of graph theory into architectural
aspects ranging from urban level planning to neighborhood level planning, site level planning and building
level planning aspects. The major areas of graph theory are analyzed analytical and provides varied range of
architectural applications and for designing of built forms.

Keywords: Graph Theory, Architectural Planning, Architectural Built Forms, and Urban Design.

Introduction: In the early stages of architectural design, original concepts were created in 2-D. Designers had
to physically draw a picture of their vision in order to communicate their ideas clearly with other interested
individuals. Much time was spent erasing and refining images and blueprints but now with the advances in
technology so much more can be accomplished than in the past. But since technology has taken its pace,
architectural creations today has predominance in homogeneous style of design not much differentiated in its
nature from each other like how it was used to be in early ages of architecture.

The design process is a complex and organic one. The freedom to let your mind and your pencil wander
through ideas always results in the most rewarding and successful designs. Going down the lane to achieve the
traditional method of designing, Graph theoretical approach is one such method to develop architectural
design as such in traditional means.

In recent times, graph theory is used in various fields of architecture in terms of planning. Although graph
theory is used in many previous studies, by contrast this paper will present interpretation of graph theoretical
approach in analyzing architectural built forms and further interpretation in analyzing and designing urban
space network. Analysis of existing built forms and the urban network will provide a best different approach
for designing a mathematical model for the evolution of architectural built forms and a better urban design
framework, which can manipulated for any different scale.

The first section analyses analytically a real case study on an institutional building complex (DEPARTMENT
OF ARCHITECTURE, TCE, MADURAI) with reference of previous studies and concludes with the graph
theoretical approach for the design of the institution building in terms of planning, on contrast with the graph
theoretical approach for the design of residential buildings.

The second section analyses analytically a real case study on a monumental building complex (BAHAI
TEMPLE, NEW DELHI), Mother temple of the Indian sub-continent. Lotus Temple is open to all, regardless of

IMRF Biannual Peer Reviewed (Referred) International Journal | SE Impact Factor 2.73 | 309
UGC Approved Journal - Journal No 43832

religion or any other qualification. Notable for its flower like shape, it has become a prominent attraction in
the city. The building is composed of 27 free-standing marble-clad "petals" arranged in clusters of three to form
nine sides, with nine doors opening onto a central hall with height of slightly over 40 meters and a capacity of
2,500 people. This concludes with an approach that it is possible to generate a built form in architecture
through graph theory.

The third section analyses urban space network with reference to the previous studies , a real case study on a
existing urban space (LUTYEN’S DELHI) an area in New Delhi, India, named after the British architect Edwin
Lutyens (1869–1944), who was responsible for much of the architectural design and building when India was
part of the British Empire in the 1920s and 1930s and 1940s.And concludes with a design strategy for the design
of efficient urban space network that would perfectly suit the present day context.

Architectural Framework: Since time of Vitruvius, goals of architecture have been expressed in terms of
firmness (Techniques)(figure 1), commodity (function), delight (aesthetics). Technology & Function &
Aesthetics are the Traditional derivatives of Engineering & social sciences & arts. Function relates to the usage
of the techniques and ending up with planning aspect. Aesthetics for instance relates to the visibility graph
analysis (derived from techniques, still functional and at last aesthetics.

Figure 1: Architectural Framework

Institutional Building Complex: Simple graph , also a strict graph - Represents rooms(figure 2) (Staff cabins
, Toilets , Library , Lecture halls, Labs etc.,) as simple graphs (i.e.) planar graphs , weighted graphs , undirected
graphs , connected graphs(Figure 2).

Figure 2: Floor Plans Represented Through Graph Theoretical Approach

Journal Published by IMRF Journals | Dec 2017 Edition | 310

Mathematical Sciences International Research Journal Volume 6 Spl Issue ISSN 2278-8697

Connectivity: A pseudo graph is a non-simple graph in which both graph loops and multiple edges are
permitted. In this case ,considering the studios (1yr studio sec A & B , 3yr studios sec A & B , 2yr studio sec A) ,
has multiple edges & self loops (Figure 3).

Figure 3: Floor Plans Representing Pseudo Graphs

When pseudo graphs come into play, connected graphs will still remain connected by the introduction of
concepts of CUT VERTICES AND CUT EDGES.

In SIMPLE GRAPHS, (Figure 4) Connected graphs will change its state to disconnected graphs, if one EDGE
OR VERTEX is removed from simple graph, IT LOSES ITS CONNECTIVITY. In PSEUDO GRAPHS, Connected
graphs will NOT change its state to disconnected graphs, if one EDGE is removed from simple graph. The edge
or vertex which is removed is known as CUT EDGES or CUT VERTEX.

Pseudo graphs are possible in the case of institutional buildings, on basis of user flow and human behaviour
both in terms of qualitative and Quantitative aspect and in turn visibility proportionally increases.

Figure 4: Disconnected Graphs

Degree Based Approach: The vertices with lowest degree (1 degree) correspond to spaces (STAFF CABINS &
TOILETS ) that require more privacy or because of smell is more isolated, The vertices with Medium degree (1
or 2 degree) corresponds to main spaces (studios ,lecture halls).The vertices with Highest degree corresponds
to circulation spaces (access to the majority of spaces - corridor & courtyards) (Figure 5).

Eccentricity (Distance) Based Approach: The lowest eccentricity corresponds to the central space –
CORRIDOR. (Circulation space –minimum travel distance to the maximum surrounding spaces), the highest
eccentricity corresponds to the perimeter spaces – STAFF CABINS & TOILETS. (Comparatively at a farther
reach to enhance privacy or to isolate smell).The medium eccentricity corresponds to the two main spaces –
STUDIOS & LECTURE HALLS. (Circulation space and the studios).Degree based approach is INVERSELY
PROPORTIONAL TO Eccentricity based approach (Figure 5).

IMRF Biannual Peer Reviewed (Referred) International Journal | SE Impact Factor 2.73 | 311
UGC Approved Journal - Journal No 43832

Figure 5: Floor Plans Representing Degree Based And Eccentricity Based Approaches

Zoning of spaces, Degree – location of spaces (NODES) &Eccentricity – Length of the circulation route
(EDGES)

Axial Line (Lines Of Sight) & Visibility Graph Analysis: On basis of Neighbourhood
1. Spaces surrounding staff cabin 2,2. Spaces surrounding staff cabin 5,3. Spaces surrounding HOD cabin,4.
Spaces surrounding staff cabin 8. (Figure 6)

Figure 6: Floor Plans Representing Axial Line Analysis

On overlap of Neighborhoods (Figure 7a) & Does HOD cabin provide the maximum visual information about
the department? (Figure 7b).

Figure 7: Floor Plans Representing Axial Line Analysis and Visibility Graph Analysis
Figure 7a: On Overlap Of Neighbourhoods, 7b: From HOD Cabin.

Journal Published by IMRF Journals | Dec 2017 Edition | 312

Mathematical Sciences International Research Journal Volume 6 Spl Issue ISSN 2278-8697

When considered within a space, main activity by the user in that space (i.e. staff cabin - seating). If position of
seating, is on the domination point (based on the axial line analysis) gives best view of the neighbourhood.

Centrality: To analyse, if whether the hierarchy of the spaces is also achieved in the location of spaces . In this
case of institutional building complex, to justify if whether HOD CABIN is placed at close proximity(Figure 8)
to all the other staff cabins, than any other preferable location in the department . Distance of the path to be
travelled is calculated in terms of nodes & cut vertices. PASSAGE STRUCTURE (NEAREST NEIGHBOR
ALGORITHM) theory is utilised.

HOD has a higher weight (closer proximity to other staff cabins), based on location (centrality),measuring
distance in terms of nodes and edges to reach the HOD cabin from all other cabins, taken into consideration.
Librarian staff (3 cut vertices , 2 nodes),Staff cabin 1 (3 cut vertices , 2 nodes),Staff cabin 2 (4 cut vertices , 3
nodes),Staff cabin 3 (5 cut vertices , 3 nodes),Staff cabin 4 (5 cut vertices , 4 nodes),Staff cabin 5 (4 cut vertices ,
5 nodes),Staff cabin 6 (5 cut vertices , 5 nodes),Staff cabin 7 (2 cut vertices , 2 nodes),Staff cabin 8 (3 cut
vertices , 2 nodes),Staff cabin 9 (3 cut vertices , 5 nodes) & Staff cabin 10(3 cut vertices , 4 nodes).

Allocation of spaces based on its importance (NODES), Spaces of higher priority. Shortest traversal path to
reach the destination (PATHS).The circulation route could be efficiently designed.

Figure 8: Floor Plans Representing Centrality And Semi Graph Analysis

Heuristic algorithms which were solved using TRAVELLING SALESMAN PROBLEM (TSP), (Figure 8)
comprising of nearest neighbor algorithm (NNA), Hamiltonian graph and Euleran graph, Could be used to
design circulation pattern efficiently by analyzing the activities of the space.

Monumental Building Complex:

Figure 9: Site Plan Representing Dominating Point

IMRF Biannual Peer Reviewed (Referred) International Journal | SE Impact Factor 2.73 | 313
UGC Approved Journal - Journal No 43832

Figure 10: Lotus Temple Elevation And Form Analysis

Journal Published by IMRF Journals | Dec 2017 Edition | 314

UGC Approved Journal - Journal No 43832

Figure 11: Lotus Temple Interior Structural Analysis

Journal Published by IMRF Journals | Dec 2017 Edition | 315

UGC Approved Journal - Journal No 43832

Likewise, a mathematical model can be developed to evolve architectural forms.

Urban Space Network: Networks: We live in connected networks. All sorts of complex systems we encounter
in nature, ranging from interacting molecules, genes to neurons, human relationships, social systems, and
physical networks can be viewed as networks. Networks are systems of interconnected and interacting
elements or components. Graph theory, the mathematical formal language that describes and quantifies
networks. Real world networks here, by the means of physical distance and all about its discrete locations.
Graph is a mathematical representation of networks, networks fall under weighted graphs, considers the
physical distance between the neighbours as weight and undirected graphs, since movement of walk is
bidirectional.

Parameters considered for analyzing the network are connectivity, network topology, node degree, degree
distribution, centrality, assortativity, path length and efficiency, Dijsktra’s algorithm, Robustness and
resilience, hubs, connection density and cost, clustering coefficient. Considered here is the decentralized
network of Lutyens Delhi, India (Figure 12).

Figure 12: Plan showing Lutyens Delhi

Analysing The Nature Of A Cluster In A Decentralized Network: (Figure 13) Representation of nodes and
its hierarchy with respect to physical discrete locations of the node respective of the other nodes in the
network.

Classification of Clusters Based on Their Locations Into:

1. Strongly perfect network (SPN), 2. Strongly weekly perfect network (SWPN), 3.Weekly strongly perfect
network (WSPN) – interpreted from the previous studies.

Figure 13: Conceptual Cluster Representation

Journal Published by IMRF Journals | Dec 2017 Edition | 316

Mathematical Sciences International Research Journal Volume 6 Spl Issue ISSN 2278-8697

Graphical Representations:

Figure 14: Graphical Representation of India Gate and its neighborhood

Figure 15: Graphical Representation of Rashtrapathi Bhavan and its neighborhood

Figure 16: Graphical Representation of Connaught Place and its neighborhood

In this case,
(Figure 17) Cluster consists of one dominating node and it exerts influence on the adjacent dominating nodes
and in turn to the next to adjacent dominating nodes. All the clusters exerts weekly strongly perfect network
(SWPN).Here the dominating source node exerts very less influence next to adjacent dominating node.

IMRF Biannual Peer Reviewed (Referred) International Journal | SE Impact Factor 2.73 | 317
UGC Approved Journal - Journal No 43832

Figure 17: Cluster Analysis

Hence if, clusters in a decentralized network if designed as strongly weekly perfect network (SWPN), then the
dominating would exerts its nature to its neighborhood and would function efficiently.
There are as a whole, different possibilities of how a two clusters can be linked together to form a holistic
network. Depending upon its nature of linkage strength of the network is accessed and also determines the
level of influence of each space in its neighborhood.

Figure 18: Conceptual Linkage of Cluster

As this single cluster cannot exist on its own, to form the entire urban space network, hence clusters when
linked forms major urban space to meet the population demands of the present context. (Figure 18) Represents
the conceptual linkage of Lutyens,Delhi.

Figure 19: Graphical Representation Of Linkage Of Cluster In Lutyens, Delhi

Journal Published by IMRF Journals | Dec 2017 Edition | 318

Mathematical Sciences International Research Journal Volume 6 Spl Issue ISSN 2278-8697

(Figure 19) Analyzing, the adjacent dominant nodes of the cluster is linked to the adjacent dominant nodes of
another cluster to form a unit as whole. Capacity of the dominating node is slightly increased, since it gains
some influence of the neighbor network through the connections made between next-dominant nodes.
Clusters of weekly strongly perfect network (WSPN) when combine; next to adjacent dominant node (NADN)
becomes excluded, moves out of concentration, node of lower degree. Since exclusion, when combining unit
clusters; the cluster networks alters its state to strongly weekly perfect network (SWPN).

In a sparsely knitted network, decentralization can enhance the efficiency of the network as a whole.
DECENTRALIZED NETWORK - STRONGLY WEEKLY PERFECT NETWORK (SWPN) - efficient design.

Figure 20: Sperner Grid

(Figure 20) Another theoretical approach to the design of urban networks, should possess different natures of
the graph by name connected graph, incomplete graph, non-simple graph, closeness centrality, clustering
coefficient. Sperner Grid, a concept satisfies all such natures required, would be more efficient and could be
scaled as the demand rises and other beneficial aspects such as visibility in the neighborhood, also would
achieve equally distributed footfall through the organization of spaces in the network.

Conclusion: Graph theory in architecture could be used to bring back the lost nature of architectural design
process, which was followed earlier-the trend of designing projects manually. In turn descending through the
ages, this approach would provide accuracy in addition to the traditional essence of architectural design
process. For large scale projects, mathematical models could be evolved, which could be manipulated to suit
the demands and the needs. Graph theory, science that technically and accurately supports art forms, ends up
with the fruitfulness of architecture which would pave way to the better efficient architectural design.

References:

1. Nophaket Napong, “The graph geometry for architectural planning”, Research student Institute of
Industrial science, The University of Tokyo, Japan.
2. Gerald Franz, Hanspeter A. Mallot, & Jan M. Wiener , “Graph-based Models of Space in Architecture and
Cognitive Science - a Comparative Analysis”, Kognitive Neurowissenschaft Fakultät für Biologie,
Universität Tübingen Auf der Morgenstelle 28, 72076 Tübingen.
3. Michael Dawes, Michael J. Ostwald, “Precise Locations in Space: An Alternative Approach to Space Syntax
Analysis Using Intersection Points”, School of Architecture and Built Environment, The University of
Newcastle, Callaghan, NSW, 2308, Australia.
4. Michael Dawes, Michael J. Ostwald, “Applications of Graph Theory in Architectural Analysis: Past, Present
and Future Research”, NOVA University of Newcastle Research Online nova.newcastle.edu.au.
5. Khaled Nassar, “New Advances in the Automated Architectural Space Plan Layout Problem”, American
university in Cairo, Egypt.
6. M.F Blanco and M.Pisonero, “An Application of Graphs in Architecture”.
7. Paul Van Dooren, “Graph Theory and Applications”, Université catholique de Louvain Louvain-la-Neuve,
Belgium, Dublin, August 2009.

IMRF Biannual Peer Reviewed (Referred) International Journal | SE Impact Factor 2.73 | 319
 UGC Approved Journal - Journal No 43832

8. Carlo Ratti, “Urban texture and space syntax: some inconsistencies” , School of Architecture and Planning,
Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139, USA; e-mail:
ratti@media.mit.edu Received 13 March 2003; in revised form 25 May 2003].
9. Abhijit Paul, “Axial Analysis: A Syntactic Approach to Movement Network Modeling”, Institute of Town
Planners, India Journal 8 - 1, 29 - 40, January - March 2011.
10. Jie Wu and Hailan Li, “Domination and Its Applications in Ad Hoc Wireless Networks with Unidirectional
Links”, Department of Computer Science and Engineering Florida Atlantic University Boca Raton, FL
33431 fjie, hlig@cse.fau.edu .
11. “Sperner’s Lemma: An Application of Graph Theory”, Spring 2016, Johns Hopkins University.
12. 1K. Thiagarajan, 2R. Satheesh Babu, 3K. Saranya, “Construction of Network and (i, j) – Distance Graph”, 1,2
Department of Mathematics, 3 Department of Information Technology 1,3 PSNA College of Engineering
and Technology, Dindigul, India. 2 Research Scholar (Ph.D-CB-JUL2014-0287), Bharathiar University,
Coimbatore, India.Received: 12 May 2015; Accepted: 18 July 2015.
13. 1K. Thiagarajan, 2A. Veeraiah, 3K. Saranya, “A Secure Transmission Approach of Big Data Based on Server
Side Domination Node and BST Coverage Analysis”, 1,2 Department of Mathematics, 3 Department of
Information Technology 1,3 PSNA College of Engineering and Technology, Dindigul, India. 2 Research
Scholar (2014- 0286),Bharathiyar University, Coimbatore, India. Received: 12 May 2015; Accepted: 18 July
2015.

***

Journal Published by IMRF Journals | Dec 2017 Edition | 320

View publication stats