Some Forbidden Subgraphs of Trees Being Opposition Graphs
In-Jen Lin,
Yi-Wu Chang,
Cheng-Wei Pan
Issue:
Volume 2, Issue 4, December 2017
Pages:
119-124
Received:
17 March 2017
Accepted:
28 March 2017
Published:
15 May 2017
DOI:
10.11648/j.dmath.20170204.11
Downloads:
Views:
Abstract: In this paper, we use the number of vertices with degree greater than or equal to 3 as a criterion for trees being opposition graphs. Finally, we prove some families of graphs such as the complement of Pn, Cn with n≥3 and n = 4k, for k∈ℕ, are opposition graphs and some families of graphs such as the complement of Tn, Cn with n≥3 and n ≠ 4k, for k∈ℕ, are not opposition graphs.
Abstract: In this paper, we use the number of vertices with degree greater than or equal to 3 as a criterion for trees being opposition graphs. Finally, we prove some families of graphs such as the complement of Pn, Cn with n≥3 and n = 4k, for k∈ℕ, are opposition graphs and some families of graphs such as the complement of Tn, Cn with n≥3 and n ≠ 4k, for k∈ℕ...
Show More
On Recurrence Relations and Application in Predicting Price Dynamics in the Presence of Economic Recession
Philip Ajibola Bankole,
Ezekiel Kadejo Ojo,
Mary Olukemi Odumosu
Issue:
Volume 2, Issue 4, December 2017
Pages:
125-131
Received:
26 February 2017
Accepted:
27 March 2017
Published:
8 June 2017
DOI:
10.11648/j.dmath.20170204.12
Downloads:
Views:
Abstract: Recurrence relations is one of the fundamental Mathematical tools of computation as most computational tasks rely on recursive techniques at one time or the other. In this paper, we present some important theorems on recurrence relations and give more simplified approach of determining an explicit formula for a given recurrence relation subject to specified boundary values (initial conditions). We recursively apply Recurrence Relation technique to model Economic wealth decay as a result of recession. We show both numerical computation and graphical representation of our simple model and analysis of market price dynamics due to Economic recession.
Abstract: Recurrence relations is one of the fundamental Mathematical tools of computation as most computational tasks rely on recursive techniques at one time or the other. In this paper, we present some important theorems on recurrence relations and give more simplified approach of determining an explicit formula for a given recurrence relation subject to ...
Show More
Some Bounds of the Largest H-eigenvalue of R-uniform Hypergraphs
Bo Deng,
Xia Wang,
Chunxia Wang,
Xianya Geng
Issue:
Volume 2, Issue 4, December 2017
Pages:
132-135
Received:
29 August 2017
Accepted:
13 September 2017
Published:
6 November 2017
DOI:
10.11648/j.dmath.20170204.13
Downloads:
Views:
Abstract: The spectral theory of graphs and hypergraphs is an active and important research field in graph and hypergraph theory. And it has extensive applications in the fields of computer science, communication networks, information science, statistical mechanics and quantum chemistry, etc. The H-eigenvalues of a hypergraph are its H-eigenvalues of adjacent tensor. This paper presents some upper and lower bounds on the largest H-eigenvalue of r-hypergraphs.
Abstract: The spectral theory of graphs and hypergraphs is an active and important research field in graph and hypergraph theory. And it has extensive applications in the fields of computer science, communication networks, information science, statistical mechanics and quantum chemistry, etc. The H-eigenvalues of a hypergraph are its H-eigenvalues of adjacen...
Show More
