Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- K-forcing number (2)
- Block (1)
- Claw-free graph (1)
- Combinatorial proof (1)
- Combinatorics (1)
-
- Connected hypergraph (1)
- Connectivity (1)
- Cut edge (1)
- Cut vertex (1)
- Cycle (1)
- E-super vertex magic graph (1)
- E-super vertex magic labeling (1)
- E-super vertex magic labelling (1)
- Enumerative combinatorics (1)
- Euclidean distance graph (1)
- F-Geometric mean graph (1)
- F-Geometric mean labelling (1)
- Fractional chromatic number (1)
- Girth (1)
- Graph isomorphisms (1)
- Graph theory (1)
- Hypergraph (1)
- Incidence graph (1)
- Incomplete tribonacci polynomials (1)
- Independent monopoly set of a graph (1)
- Independent monopoly size of a graph (1)
- Independent set (1)
- K-forcing set (1)
- Labelling (1)
- Lajos Takács (1)
Articles 1 - 15 of 15
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).
Counting The Angels And Devils In Escher's Circle Limit Iv, John Choi, Nicholas Pippenger
Counting The Angels And Devils In Escher's Circle Limit Iv, John Choi, Nicholas Pippenger
Journal of Humanistic Mathematics
We derive the rational generating function that enumerates the angels and devils in M. C. Escher's Circle Limit IV according to their combinatorial distance from the six creatures whose feet meet at the center of the disk. This result shows that the base of the exponential rate of growth is 1.582... (the largest root of the polynomial 1 - z^2 - 2z^3 - z^4 + z^6).
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, . . …
Path-Tables Of Trees: A Survey And Some New Results, Kevin Asciak
Path-Tables Of Trees: A Survey And Some New Results, Kevin Asciak
Theory and Applications of Graphs
The (vertex) path-table of a tree Τ contains quantitative information about the paths in Τ. The entry (i,j) of this table gives the number of paths of length j passing through vertex vi. The path-table is a slight variation of the notion of path layer matrix. In this survey we review some work done on the vertex path-table of a tree and also introduce the edge path-table. We show that in general, any type of path-table of a tree Τ does not determine Τ uniquely. We shall show that in trees, the number of paths passing through …
Bounds For The Zero Forcing Number Of Graphs With Large Girth, Randy Davila, Franklin Kenter
Bounds For The Zero Forcing Number Of Graphs With Large Girth, Randy Davila, Franklin Kenter
Theory and Applications of Graphs
The zero-forcing number, Ζ(G) is an upper bound for the maximum nullity of all symmetric matrices with a sparsity pattern described by the graph. A simple lower bound is δ ≤ Ζ(G) where δ is the minimum degree. An improvement of this bound is provided in the case that G has girth of at least 5. In particular, it is shown that 2δ − 2 ≤ Ζ(G) for graphs with girth of at least 5; this can be further improved when G has a small cut set. Lastly, a conjecture is made regarding a lower bound for Ζ(G) as a …
An Isomorphism Problem In Z2, Matt Noble
An Isomorphism Problem In Z2, Matt Noble
Theory and Applications of Graphs
We consider Euclidean distance graphs with vertex set ℚ2 or ℤ2 and address the possibility or impossibility of finding isomorphisms between such graphs. It is observed that for any distances d1, d2 the non-trivial distance graphs G(ℚ2, d1) and G(ℚ2, d2) are isomorphic. Ultimately it is shown that for distinct primes p1, p2 the non-trivial distance graphs G(ℤ2, √p1) and G(ℤ2, √p2) are not isomorphic. We conclude with a few additional questions related to this work.
Second Hamiltonian Cycles In Claw-Free Graphs, Hossein Esfandiari, Colton Magnant, Pouria Salehi Nowbandegani, Shirdareh Haghighi
Second Hamiltonian Cycles In Claw-Free Graphs, Hossein Esfandiari, Colton Magnant, Pouria Salehi Nowbandegani, Shirdareh Haghighi
Theory and Applications of Graphs
Sheehan conjectured in 1975 that every Hamiltonian regular simple graph of even degree at least four contains a second Hamiltonian cycle. We prove that most claw-free Hamiltonian graphs with minimum degree at least 3 have a second Hamiltonian cycle and describe the structure of those graphs not covered by our result. By this result, we show that Sheehan’s conjecture holds for claw-free graphs whose order is not divisible by 6. In addition, we believe that the structure that we introduce can be useful for further studies on claw-free graphs.
Connection And Separation In Hypergraphs, Mohammad A. Bahmanian, Mateja Sajna
Connection And Separation In Hypergraphs, Mohammad A. Bahmanian, Mateja Sajna
Theory and Applications of Graphs
In this paper we study various fundamental connectivity properties of hypergraphs from a graph-theoretic perspective, with the emphasis on cut edges, cut vertices, and blocks. We prove a number of new results involving these concepts. In particular, we describe the exact relationship between the block decomposition of a hypergraph and the block decomposition of its incidence graph.
Properly Colored Notions Of Connectivity - A Dynamic Survey, Xueliang Li, Colton Magnant
Properly Colored Notions Of Connectivity - A Dynamic Survey, Xueliang Li, Colton Magnant
Theory and Applications of Graphs
A path in an edge-colored graph is properly colored if no two consecutive edges receive the same color. In this survey, we gather results concerning notions of graph connectivity involving properly colored paths.
Dynamic Approach To K-Forcing, Yair Caro, Ryan Pepper
Dynamic Approach To K-Forcing, Yair Caro, Ryan Pepper
Theory and Applications of Graphs
The k-forcing number of a graph is a generalization of the zero forcing number. In this note, we give a greedy algorithm to approximate the k-forcing number of a graph. Using this dynamic approach, we give corollaries which improve upon two theorems from a recent paper of Amos, Caro, Davila and Pepper [2], while also answering an open problem posed by Meyer [9].
Scheduling N Burgers For A K-Burger Grill: Chromatic Numbers With Restrictions, Peter Johnson, Xiaoya Zha
Scheduling N Burgers For A K-Burger Grill: Chromatic Numbers With Restrictions, Peter Johnson, Xiaoya Zha
Theory and Applications of Graphs
The chromatic number has a well-known interpretation in the area of scheduling. If the vertices of a finite, simple graph are committees, and adjacency of two committees indicates that they must never be in session simultaneously, then the chromatic number of the graph is the smallest number of hours during which the committees/vertices of the graph may all have properly scheduled meetings of one continuous hour each. Slivnik [3] showed that the fractional chromatic number can be similarly characterized. In that characterization, the meetings are allowed to be broken into a finite number of disjoint intervals. Here we consider chromatic …