Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Combinatorial proof (1)
- Combinatorics (1)
- E-super vertex magic graph (1)
- E-super vertex magic labeling (1)
- E-super vertex magic labelling (1)
-
- F-Geometric mean graph (1)
- F-Geometric mean labelling (1)
- Incomplete tribonacci polynomials (1)
- Independent monopoly set of a graph (1)
- Independent monopoly size of a graph (1)
- Labelling (1)
- Lajos Takács (1)
- Monopoly set of a graph (1)
- Super vertex magic labeling (1)
- Super vertex magic labelling (1)
- Tribonacci numbers (1)
- Vertex degree (1)
Articles 1 - 6 of 6
Full-Text Articles in Mathematics
F–Geometric Mean Graphs, A. D. Baskar, S. Arockiaraj
F–Geometric Mean Graphs, A. D. Baskar, S. Arockiaraj
Applications and Applied Mathematics: An International Journal (AAM)
In a study of traffic, the labelling problems in graph theory can be used by considering the crowd at every junction as the weights of a vertex and expected average traffic in each street as the weight of the corresponding edge. If we assume the expected traffic at each street as the arithmetic mean of the weight of the end vertices, that causes mean labelling of the graph. When we consider a geometric mean instead of arithmetic mean in a large population of a city, the rate of growth of traffic in each street will be more accurate. The geometric …
In Honor And Memory Of Professor Lajos Takács, Aliakbar M. Haghighi, Sri G. Mohanty
In Honor And Memory Of Professor Lajos Takács, Aliakbar M. Haghighi, Sri G. Mohanty
Applications and Applied Mathematics: An International Journal (AAM)
This issue of AAM is dedicated to honoring and remembering Professor Lajos Takács. While wrapping up the manuscript of my book (co-authored by Dr. Dimitar Mishev): Delayed and Network Queues, I went back to celebrate his 1962 book, Introduction to the Theory of Queues, where he gives an example illustrating a waiting time paradox, where the waiting time of a passenger waiting for a bus at a bus stop is infinite, while, in reality, he will wait a finite unit of time before a bus arrive. I sent Professor Takács an e-mail on December 4, 2015, inquiring if he had …
Independent Monopoly Size In Graphs, Ahmed M. Naji, N. D. Soner
Independent Monopoly Size In Graphs, Ahmed M. Naji, N. D. Soner
Applications and Applied Mathematics: An International Journal (AAM)
In a graph G = (V;E), a set D ⊆V (G) is said to be a monopoly set of G if every vertex v ∈V-D has at least d(v)/ 2 neighbors in D. The monopoly size of G, denoted mo(G), is the minimum cardinality of a monopoly set among all monopoly sets in G. The set D ⊆ V (G) is an independent monopoly set in G if it is both a monopoly set and an independent set in G. The number of vertices in a minimum independent monopoly set in a graph G is the independent monopoly size of …
Solution To Some Open Problems On E-Super Vertex Magic Total Labeling Of Graphs, G. Marimuthu, M. S. Raja Durga, G. D. Devi
Solution To Some Open Problems On E-Super Vertex Magic Total Labeling Of Graphs, G. Marimuthu, M. S. Raja Durga, G. D. Devi
Applications and Applied Mathematics: An International Journal (AAM)
Let G be a finite graph with p vertices and q edges. A vertex magic total labeling is a bijection f from V(G)∪E(G) to the consecutive integers 1, 2, ..., p+q with the property that for every u∈V(G) , f( u)+ ∑f(uv)=K for some constant k. Such a labeling is E-super if f :E(G)→{1, 2,..., q}. A graph G is called E-super vertex magic if it admits an E-super vertex magic labeling. In this paper, we solve two open problems given by Marimuthu, Suganya, Kalaivani and Balakrishnan (Marimuthu et al., 2015).
Combinatorial Identities For Incomplete Tribonacci Polynomials, Mark Shattuck
Combinatorial Identities For Incomplete Tribonacci Polynomials, Mark Shattuck
Applications and Applied Mathematics: An International Journal (AAM)
The incomplete tribonacci polynomials, denoted by Tn(s)(x), generalize the usual tribonacci polynomials Tn (x) and have been shown to satisfy several algebraic identities. In this paper, we provide a combinatorial interpretation for Tn(s)(x) in terms of weighted linear tilings involving three types of tiles. This allows one not only to supply combinatorial proofs of earlier identities for Tn(s)(x) but also to derive new ones. In the final section, we provide a formula for the ordinary generating function of the sequence Tn(s)(x) for a fixed s, as previously …
E-Super Vertex Magic Labelling Of Graphs And Some Open Problems, G. Marimuthu, B. Suganya, S. Kalaivani, M. Balakrishnan
E-Super Vertex Magic Labelling Of Graphs And Some Open Problems, G. Marimuthu, B. Suganya, S. Kalaivani, M. Balakrishnan
Applications and Applied Mathematics: An International Journal (AAM)
Let G be a finite graph with p vertices and q edges. A vertex magic total labelling is a bijection from the union of the vertex set and the edge set to the consecutive integers 1, 2, 3, . . . , p + q with the property that for every u in the vertex set, the sum of the label of u and the label of the edges incident with u is equal to k for some constant k. Such a labelling is E-super, if the labels of the edge set is the set {1, 2, 3, . . …