For a connected nontrivial graph G, the maximum linear forest of G is the linear forest having maximum number of edges. The number of edges in a maximum linear forest is denoted by \(\ell\)`(G). In this paper we determine the maximum linear forest of the join and union of nontri...
Open access
Research Article10.9734/arjom/2023/v19i10720
For a nontrivial connected graph G, a non-empty set S \(\subseteq\) V (G) is a bipartite dominating set of graph G, if the subgraph G[S] induced by S is bipartite and for every vertex not in S is dominated by any vertex in S. The bipartite domination number denoted by \(\gamma\)b...
Open access
Research Article10.9734/arjom/2023/v19i3645
Remarl Joseph M. Damalerio, Rolito G. Eballe, Cherry Mae R. Balingit, Isagani S. Cabahug Jr. & Ann Leslie V. Flores·Asian Research Journal of Mathematics·2022
The global clustering coefficient is one of the most useful indices in complex network analysis. It is another metric that somehow measures how close a graph from being a complete graph. In this paper we present some expressions for the global clustering coefficient of the join G...
Open access
Research Article10.9734/arjom/2022/v18i12632