DIMAP and Mathematic Institute, University of Warwick, Coventry CV4 7AL, UK Research of this author was supported by the Centre for Discrete Mathematics and Its Applications (DIMAP), University of ...
ABSTRACT: Let G=( V,E ) be a graph. The first Zagreb index of a graph G is defined as ∑ u∈V d G 2 ( u ) , where d G ( u ) is the degree of vertex u in G . In this paper, we obtain two lower bounds ...
ABSTRACT: Let G=( V,E ) be a graph. The first Zagreb index of a graph G is defined as ∑ u∈V d G 2 ( u ) , where d G ( u ) is the degree of vertex u in G . In this paper, we obtain two lower bounds ...
Graph theory is an area in discrete mathematics which studies configurations (called graphs) involving a set of vertices interconnected by edges. This book is intended as a general introduction to ...
Abstract: A vertex set D ⊆ V is considered a dominating set of G if every vertex in V − D is adjacent to at least one vertex in D. We called a dominating set D as a paired-dominating set if the ...
Modern systems are critically dependent on software for their design and operation. The next generation of developers must be facile in the specification, design and implementation of dependable ...
# Onsite assessment venue at NTU will be announced closer to the final exam date. Each module cost S$250. Learners can use their SkillsFuture credits to pay or partially pay for the bridging modules.