Research & Reviews: Discrete Mathematical Structures
Volume 5, Issue 2 (2018)
Published
Table of contents
-
Vertex Odd Divisor Cordial Labeling of Ring Sum of Different Graphs With star Graph
Abstract: A graph tt = (V, E) is said to have a vertex odd divisor cordial labeling if there is a bijection f : {1, 3, . . . , 2n − 1} such that each edge e = uv is assigned the label 1 if f (u)|f (v) or f (v)|f (u) and 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 2, 2018 · pp. 1–9 Read article
-
Further Results on Some Degree Based Topological Indices of Sierpi´cski Graphs
Abstract: Sierpi´cski graphs S(n, k) were defined originally in 1997 by Sandi Klavˇzarand Uroˇs Milutinovi´c. In this paper, degree based topological indices ofSierpi´cski graphs are considered. In particular M1(G), M2(G), M1(G, x), M2(G, x), R(G), (G), ABC(G), ABC4(G), GA(G), GA5(G), H(G), AZI(G), S(G) and F(G) of Sierpi´cski graphs are determined.
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 2, 2018 · pp. 10–21 Read article
-
A Graph Theoretic Approach to quantify the Conflict of Traffic Streams in a Traffic Intersection
Abstract: A traffic intersection can be modelled by a graph by considering the streams as vertices and assigning an edge based on the mutually non-conflict streams. In this paper we propose a spectral approach to arrange the steams in order of their conflict and hence determine the most conflicted stream in a traffic intersection.
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 2, 2018 · pp. 22–25 Read article
-
On Structure and Robustness of Airport Network of India
Abstract: This paper uses a complex network approach to study the structure and robustness of Airport Network of India (ANI). The ANI displays small-world (SW) network properties with an average path length of 2.262 and a clustering coefficient of 0.605, and it also exhibits disassortative mixing on degree of nodes, that means the high-degree nodes in the network tend to have connections with low-degree nodes. Being a disassortative network, ANI doesn’t …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 2, 2018 · pp. 26–33 Read article
-
FD and DDA of N2 Function
Abstract: The object of the present paper is to establish the results of Double Dirichlet average (DDA) of N2 Function, using Riemann-Liouville Fractional derivative (FD). This function is a modified form of Mittag-Leffler function [15]. The author drives the results between N2-function and fractional operators. The N2 Function can be measured as a Dirichlet average and connected with fractional calculus. In this paper the solution comes in compact form of double …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 2, 2018 · pp. 34–39 Read article