398 hasil
Menampilkan 1–20 · 0,17 detik · RSS
Electronic Journal of Graph Theory and Applications
Scopus
ISSN 2338-2287 · Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia · 398 artikel di indeks
-
Artikel Jurnal
Homotopy covers of graphs
We develop a theory of ×-homotopy, fundamental groupoids and covering spaces that applies to non-simple graphs, generalizing existing results for simple graphs. We prove that ×-homotopies from finite graphs can be decomposed into moves that adjust at most one vertex at a time, generalizing the…
-
Artikel Jurnal
Odd order C₄-face-magic projective grid graphs
For a graph G = (V, E) embedded in the projective plane, let F(G) denote the set of faces of G. Then, G is called a Cₙ-face-magic projective graph if there exists a bijection f: V(G) → {1, 2, …, |V(G)|} such that for any F ∈ F(G) with F ≅ Cₙ, the sum of all the vertex labels around Cₙ is a constant…
-
Artikel Jurnal
Some properties of stepwise irregular graphs
Graphs in which the absolute difference between the degrees of any two adjacent vertices is exactly one, are called stepwise irregular (SI) graphs. We establish several properties of SI graphs. In particular, we show that SI graphs of different order and cyclomatic numbers can be constructed from…
-
Artikel Jurnal
The Edge Metric Dimension of the Comb Product of a Cycle and a Graph with a Dominant Vertex
In this paper, we determine the edge metric dimension of the comb product of a cycle graph and a simple graph containing a dominant vertex. This result generalizes previous findings on the edge metric dimension of the comb product of a cycle and a complete graph. We show that the edge metric…
-
Artikel Jurnal
Computation of the eigenvalues of complete signed graphs
A signed graph Σ is the ordered pair (G,σ), where G=(V,E) is a finite simple graph, called the underlying graph, and σ: E(G) → {+1, -1} is a sign function or a signature of Σ. Let (K_n,σ) be a complete signed graph with n vertices. In this paper, we give a complete description of the adjacency…
-
Artikel Jurnal
Graph-theoretic properties of inversion-transpositions
Dénés established the connection between labeled trees in Graph Theory and factorizations of cyclic permutations by means of transpositions. In this paper, we introduce the notion of an inversion-transposition, which has both the properties of an inversion and a transposition. For a cyclic…
-
Artikel Jurnal
Coloring discrete pseudomanifolds
This paper presents three main results concerning the coloring of discrete d-pseudomanifolds: (1) the general chromatic bounds d+1 ≤ X(K) ≤ 2d+2 for any d-pseudomanifold K; (2) an improved bound X(K) ≤ 2d+1 for a d-pseudomanifold expressible as a join K = Sk + K', where Sk is a cyclic k-sphere and…
-
Artikel Jurnal
Labeled graph rearrangements on matched and star products
In this paper we present enumerative results for Stirling numbers of the first kind for two graph products, the matched product and the m-star, using the combinatorial model of rearrangements. The kth Stirling number of the first kind for a simple graph G counts the number of ways to decompose G…
-
Artikel Jurnal
Optimization of layout for embedding complete k-partite graphs into line graphs of certain tree architectures
The capability of one architecture to simulate another serves as the foundation for network comparison, with embedding playing a key role in analyzing these simulations. In architectural simulation, graph embedding is one of the most powerful techniques for executing parallel algorithms and…
-
Artikel Jurnal
Analogues of Bermond-Bollobás conjecture for cages yield expander families
This paper presents a possible link between Cages and Expander Graphs by introducing three interconnected variants of the Bermond and Bollobás Conjecture, originally formulated in 1981 within the context of the Degree/Diameter Problem. We adapt these conjectures to cages, with the most robust…
-
Artikel Jurnal
Modular irregularity strength of vertex amalgamation and comb product path with cycle related graphs
Consider a graph G = (V(G), E(G)), where V(G) is a nonempty set of vertices and E(G) is a set of edges. Let Zn be the group of integers modulo n, and let k be a positive integer. A modular irregular labeling of a graph G of order n is a k-edge labeling ϕ : E(G) → {1, 2, … , k}, such that an induced…
-
Artikel Jurnal
Decompositions and packings in truncated triangulations
We study decompositions and packings in truncated triangulations GT△ obtained from simple connected plane graphs G with minimum degree two. We show GT△ is a 3-connected cubic planar graph with at least 2|E(G)|² - 2|E(G)| + 1 perfect matchings, a Λ-factor, and can be decomposed into a union of C₆'s…
-
Artikel Jurnal
The matching book embedding under some graph operations
The matching book embedding of a graph G is an embedding of G with the vertices on the spine, and each edge within a single page so that the edges on each page do not intersect and the degree of vertices on each page is at most one. The matching book thickness of G is the minimum number of pages in…
-
Artikel Jurnal
The mincut graph of a graph
In this paper we introduce an intersection graph of a graph G, with vertex set the minimum edge-cuts of G. We find the minimum cut-set graphs of some well-known families of graphs and study the mincut graph as a graph operator. In doing so we follow the research programme on graph operators, as…
-
Artikel Jurnal
New bounds on the connected-pseudoachromatic index of complete graphs
We improve several previously known bounds of the connected-pseudoachromatic index of complete graphs. We apply a Rank Genetic Algorithm to find experimental solutions above the known lower bounds and then we obtain an approximation of the upper bound to verify and compare to the empirically…
-
Artikel Jurnal
A special case of the tree packing conjecture
The Tree Packing Conjecture of Gyárfás states that for any set of n-1 trees T = {T₁, T₂, …, Tn-1}, where Ti has i edges, T can be packed into Kn. We define a family of trees called two-spiders that are almost stars, and show that packings of Kn with two-spiders can be constructed by exchanging…
-
Artikel Jurnal
Bounds on Erdos - Faber - Lovász conjecture - the uniform and regular cases
We consider the Erds - Faber - Lovász (EFL) conjecture for hypergraphs. This paper gives an upper bound for the chromatic number of r regular linear hypergraphs H of size n. If r ≥ 4, χ(H)≤1.181n and if r = 3, χ(H)≤1.281n.
-
Artikel Jurnal
On the relations among edge magic total, edge antimagic total, and ASD-antimagic graphs
Let G be a simple and finite graph of order p and size q. The graph G is said to be edge magic total (EMT) if there is a bijection λ:V(G)∪E(G)→{1,2,…,p+q} such that all edge sums λ(x)+λ(xy)+λ(y), xy∈E(G), are the same. If all edge sums are pairwise distinct, then G is called edge antimagic total…
-
Artikel Jurnal
Pareto graphs
It is well-known that Pareto distribution and related generalizations have historically been considered suitable for modeling income and wealth distributions, among other fields. Nowadays, graphs can be used to model many types of relations and processes in physical, biological, social, and…
-
Artikel Jurnal
Stars in forbidden triples generating a finite set of graphs with minimum degree four
For a family H of graphs, a graph G is said to be H-free if G contains no member of H as a induced subgraph. Let G4(H) denote the family of connected H-free graphs having minimum degree at least 4. In this paper, we characterize the families H of connected graphs with |H|=3 such that H contains a…