Related papers: Notes on $\omega$-graphs, reflexive $\omega$-graph…
In this paper, we investigate odd graceful graph, odd strongly harmonious graph, bipartite graph and their relationship. We proved following results: (1) if G is odd strongly harmonious graph, then G is odd graceful graph ;(2) if G is…
In this work, we define an orthogonal graph on the set of equivalence classes of $(2\nu + \delta)-$tuples over $\mathbb{Z}_{2^n}$ where $n$ and $\nu$ are positive integers and $\delta = 0, 1$ or $2$. We classify our graph if it is strongly…
In this paper, we study 2-geodesic-transitive graphs of order twice an odd prime power. Classifications of corresponding basic graphs and such graphs with almost simple automorphism groups are given, and a reduction theorem for general case…
We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of…
This article introduces a new approach to discrete curvature based on the concept of effective resistances. We propose a curvature on the nodes and links of a graph and present the evidence for their interpretation as a curvature. Notably,…
A theory of orientation on gain graphs (voltage graphs) is developed to generalize the notion of orientation on graphs and signed graphs. Using this orientation scheme, the line graph of a gain graph is studied. For a particular family of…
Reed conjectured that for every graph, $\chi \leq \left \lceil \frac{\Delta + \omega + 1}{2} \right \rceil$ holds, where $\chi$, $\omega$ and $\Delta$ denote the chromatic number, clique number and maximum degree of the graph, respectively.…
We prove a Riemann-Roch theorem for real divisors on edge-weighted graphs over the reals, extending the result of Baker and Norine for integral divisors on graphs with multiple edges.
Recent work of Lazarovich provides necessary and sufficient conditions on a graph L for there to exist a unique simply-connected (k,L)-complex. The two conditions are symmetry properties of the graph, namely star-transitivity and…
We build new algebraic structures, which we call genuine equivariant operads, which can be thought of as a hybrid between equivariant operads and coefficient systems. We then prove an Elmendorf-Piacenza type theorem stating that equivariant…
We demonstrate that graph-based models are fully capable of representing higher-order interactions, and have a long history of being used for precisely this purpose. This stands in contrast to a common claim in the recent literature on…
We will define new constructions similar to the graph systems of correspondences described by Deaconu et al. We will use these to prove a version of Ionescu's theorem for higher rank graphs. Afterwards we will examine the properties of…
The essential parts of the operad algebra are concisely presented, which should be useful when confronting with the operadic physics. It is also clarified how the Gerstenhaber algebras can be associated with the linear pre-operads (comp…
This note resolves an open problem asked by Bezrukov in the open problem session of IWOCA 2014. It shows an equivalence between regular graphs and graphs for which a sequence of invariants presents some symmetric property. We extend this…
In this study we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This give an alternative characterization of triangulated graphs. Our method is based on…
Necessary and sufficient conditions for a finite connected graph with a strict partial order on vertices to be a combinatorial invariant of pseudoharmonic function are obtained.
This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…
A graph is called dominating if its vertices can be labelled with integers in such a way that for every function f: omega-> omega the graph contains a ray whose sequence of labels eventually exceeds f. We obtain a characterization of these…
We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…
We will consider P-graph complexes, where P is a cyclic operad. P-graph complexes are natural generalizations of Kontsevich's graph complexes -- for P = the operad for associative algebras it is the complex of ribbon graphs, for P = the…