Abstract. Let 𝐺 = (𝑉,𝐸) be a simple graph of order 𝑛 and size 𝑚 with maximum degree ∆ and minimum degree 𝛿 . The inverse degree of a graph 𝐺 with no isolated vertices is defined as ID(G)= ∑ i=1 ...

A directed graph is acyclic if and only if it has a topological ordering. A DAG model works differently than a blockchain. A common blockchain requires miners to maintain blocks, but a DAG wouldn’t ...

Topological Order and Quantum Field Theory Publication Trend The graph below shows the total number of publications each year in Topological Order and Quantum Field Theory.

Suresh Elumalai, Sunilkumar M. Hosamani, Toufik Mansour, Mohammad Ali Rostami, More on Inverse Degree and Topological Indices of Graphs, Filomat, Vol. 32, No. 1 (2018 ...