Biblio Discovery — Demo Discovery Service

143 hasil

Menampilkan 1–20 · 0,45 detik · RSS

Jurnal

Theory and Applications of Graphs

Scopus

ISSN 2470-9859 · Georgia Southern University · 143 artikel di indeks

  1. Artikel Jurnal

    The Connected Vertex Cover in Graphs

    Kamran Mirasheh; Elham Mirashe; Ebrahim Vatandoost

    Theory and Applications of Graphs, Vol. 13 No. 1 · 2026 · Inggris · DOAJ Scopus

    This paper presents tight bounds and characterizations for the vertex cover number and the connected vertex cover number of graphs. In particular, we identify all graphs for which βc(G) = |V (G)| − 1, proving that these are exactly the cycles and complete graphs. The analysis employs tools such as…

  2. Artikel Jurnal

    The $k$-Total Bondage Number of a Graph

    Jean-Pierre Appel; Gabrielle Fischberg; Kyle Kelley dkk.

    Theory and Applications of Graphs, Vol. 13 No. 1 · 2026 · Inggris · DOAJ Scopus

    Let \(G=(V,E)\) be a connected, finite undirected graph. A set \(S \subseteq V\) is said to be a total dominating set of \(G\) if every vertex in \(V\) is adjacent to some vertex in \(S\). The total domination number, \(\gamma_{t}(G)\), is the minimum cardinality of a total dominating set in \(G\)…

  3. Artikel Jurnal

    Obstructions to some injective oriented colourings

    Russell J Campbell; Nancy E Clarke; Gary MacGillivray

    Theory and Applications of Graphs, Vol. 13 No. 1 · 2026 · Inggris · DOAJ Scopus

    Each of several possible definitions of local injectivity for a homomorphism of an oriented graph $G$ to an oriented graph $H$ leads to an injective oriented colouring problem. For each case in which such a problem is solvable in polynomial time, we identify a set $\mathcal{F}$ of oriented graphs…

  4. Artikel Jurnal

    On the extreme complexity of certain nearly regular graphs

    Gregory P Constantine; Gregory C Magda

    Theory and Applications of Graphs, Vol. 13 No. 1 · 2026 · Inggris · DOAJ Scopus

    The complexity of a graph is the number of its labeled spanning trees. It is demonstrated that the seven known triangle-free strongly regular graphs are graphs of maximal complexity among all graphs of the same order and degree; their complements are shown to be of minimal complexity. A…

  5. Artikel Jurnal

    Hyper Face-Magic Graphs

    Ross Belgram; Donald McGinn

    Theory and Applications of Graphs, Vol. 13 No. 1 · 2026 · Inggris · DOAJ Scopus

    For a planar graph G of order n, let F(G) be the set of all faces of G embedded into R 2 , including the exterior face. A bijective vertex labeling f : V (G) → {1, 2, ..., n} induces a face labeling f ∗ : F(G) → N defined by setting f ∗ (F) equal to the sum of all labels of the boundary vertices of…

  6. Artikel Jurnal

    Packing independent cliques into planar graphs

    Csaba Biró; Gabriel Collado; Oscar Zamora

    Theory and Applications of Graphs, Vol. 12 No. 2 · 2025 · Inggris · DOAJ Scopus

    The indeque number of a graph is largest set of vertices that induce an independent set of cliques. We study the extremal value of this parameter for the class and subclasses of planar graphs, most notably for forests and graphs of pathwidth at most $2$.

  7. Artikel Jurnal

    Degeneracies of Triangulated Graphs

    Allan Bickle

    Theory and Applications of Graphs, Vol. 12 No. 2 · 2025 · Inggris · DOAJ Scopus

    A graph $G$ is $k$-degenerate if each subgraph has minimum degree at most $k$. The degeneracy\textbf{ }$D\left(G\right)$ is the smallest $k$ such that $G$ is $k$-degenerate. We determine the truth values of four statements (using different quantifiers) about when a planar graph $G$ with degeneracy…

  8. Artikel Jurnal

    Corrigendum to "Face-magic Labelings of Polygonal Graphs"

    Wai Chee Shiu; Richard M. Low; Andy K. Liu

    Theory and Applications of Graphs, Vol. 12 No. 2 · 2025 · Inggris · DOAJ Scopus

    In this note, we correct a misstatement of a theorem.

  9. Artikel Jurnal

    Forbidden triples for $2$-connected graphs with minimum degree three which contain $K_4$ and $K_{2,2}$

    Takafumi Kotani; Yoshimi Egawa

    Theory and Applications of Graphs, Vol. 12 No. 2 · 2025 · Inggris · DOAJ Scopus

    For a family $\mathcal{H}$ of graphs, a graph $G$ is said to be $\mathcal{H}$-free if $G$ contains no member of $\mathcal{H}$ as an induced subgraph. Let $\mathcal{G}_2^{(3)}}(\mathcal{H})$ denote the family of $2$-connected $\mathcal{H}$-free graphs having minimum degree at least $3$. This paper…

  10. Artikel Jurnal

    Star-Critical Weakened Ramsey Numbers

    Mark Budden; Monu Moun; Jagjeet Jakhar

    Theory and Applications of Graphs, Vol. 12 No. 2 · 2025 · Inggris · DOAJ Scopus

    The weakened Ramsey number $r^{s,t}(G)$ is defined to be the least $p\in \mathbb{N}$ such that every $t$-coloring of the edges of the complete graph $K_p$ contains a subgraph isomorphic to $G$ that is spanned by edges that use at most $s$ colors ($1\le s\le t-1$). The star-critical weakened Ramsey…

  11. Artikel Jurnal

    All Graphs of Order n with Distinguishing Number n−1 or n − 2

    Andi Pujo Rahadi; Edy Tri Baskoro; Suhadi Wido Saputro

    Theory and Applications of Graphs, Vol. 12 No. 1 · 2025 · Inggris · DOAJ Scopus

    Let G be a simple connected graph. The distinguishing number of G, denoted by D(G), is the least integer d such that G has a vertex d-labeling preserved only by the trivial automorphism. In this paper, we characterize all graphs of order n with distinguishing number n − 1, or n − 2.

  12. Artikel Jurnal

    Component Order Edge Connectivity, Vertex Degrees, and Integer Partitions

    Michael R. Yatauro

    Theory and Applications of Graphs, Vol. 12 No. 1 · 2025 · Inggris · DOAJ Scopus

    Given a finite, simple graph G, the k-component order connectivity (resp. edge connectivity) of G is the minimum number of vertices (resp. edges) whose removal results in a subgraph in which every component has an order of at most k − 1. In general, determining the k-component order edge…

  13. Artikel Jurnal

    Skolem Number of Kagome Lattice Graphs

    Braxton Carrigan; Max Martone

    Theory and Applications of Graphs, Vol. 12 No. 1 · 2025 · Inggris · DOAJ Scopus

    A proper Skolem labelling of a graph $G$ is a function assigning a positive integer to each vertex of $G$ such that any two vertices assigned the same integer are that distance apart in the graph. The Skolem number of a graph is smallest number $n$ such that there exists a proper Skolem labelling…

  14. Artikel Jurnal

    Lower Bounds for the Total Distance $k$-Domination Number of a Graph

    Randy R. Davila

    Theory and Applications of Graphs, Vol. 12 No. 1 · 2025 · Inggris · DOAJ Scopus

    For $k \geq 1$ and a graph $G$ without isolated vertices, a \emph{total distance $k$-dominating set} of $G$ is a set of vertices $S \subseteq V(G)$ such that every vertex in $G$ is within distance $k$ to some vertex of $S$ other than itself. The \emph{total distance $k$-domination number} of $G$ is…

  15. Artikel Jurnal

    The Integer-antimagic Spectra of a Weak Join of Hamiltonian Graphs

    Ugur Odabasi; Dan Roberts; Richard M. Low

    Theory and Applications of Graphs, Vol. 12 No. 1 · 2025 · Inggris · DOAJ Scopus

    A simple graph $G$ with vertex set $V(G)$ and edge set $E(G)$ is \emph{$\mathbb{Z}_{k}$-antimagic} if there exists a function $f: E(G) \to \mathbb{Z}_{k} \backslash \{0\}$ such that the induced function $f^+(v)=\sum_{uv\in E(G)} f(uv)$ is injective. The \textit{integer-antimagic spectrum} of a…

  16. Artikel Jurnal

    Combinatorial rigidity and flexibility of simplicial 2-complexes with few vertices

    Serge A. Lawrence; Abdulkarim M. Magomedov; Olga I. Chelyapina dkk.

    Theory and Applications of Graphs, Vol. 12 No. 1 · 2025 · Inggris · DOAJ Scopus

    We study the problem of reconstruction of a simplicial 2-complex from its 1- skeleton together with the prescribed quantities of 2-simplices at each 1-simplex, under the restriction that these quantities are bounded above by 2. It is a known fact that a 2-complex is uniquely reconstructible, or…

  17. Artikel Jurnal

    Prime labelings on a 3xn grid graph

    Stephen J. Curran; Matt A. Ollis

    Theory and Applications of Graphs, Vol. 12 No. 1 · 2025 · Inggris · DOAJ Scopus

    It is conjectured that the mxn grid graph has a prime labeling for all positive integers m and n. It is known that for any prime p and any integer n such that 1≤n≤p2, there exists a prime labeling on the pxn grid graph Pm x Pn. Also, it is known that the ladder P2 x Pn has a prime labeling for all…

  18. Artikel Jurnal

    Face-magic Labelings of Polygonal Graphs

    Wai Chee Shiu; Richard M. Low; Andy K. Liu

    Theory and Applications of Graphs, Vol. 11 No. 1 · 2024 · Inggris · DOAJ Scopus

    For a plane graph $G = (V, E)$ embedded in $\mathbb{R}^2$, let $\mathcal{F}(G)$ denote the set of faces of $G$. Then, $G$ is called a \textit{$C_n$-face-magic graph} if there exists a bijection $f: V(G) \to \{1, 2, \dots, |V(G)|\}$ such that for any $F \in \mathcal{F}(G)$ with $F \cong C_n$, the…

  19. Artikel Jurnal

    Apex Graphs and Cographs

    Jagdeep Singh; Vaidy Sivaraman; Thomas Zaslavsky

    Theory and Applications of Graphs, Vol. 11 No. 1 · 2024 · Inggris · DOAJ Scopus

    A class G of graphs is called hereditary if it is closed under taking induced subgraphs. We denote by G^{apex} the class of graphs G that contain a vertex v such that G − v is in G. Borowiecki, Drgas-Burchardt, and Sidorowicz proved that if a hereditary class G has finitely many forbidden induced…

  20. Artikel Jurnal

    Failed Zero Forcing Numbers of Trees and Circulant Graphs

    Luis Gomez; Karla Rubi; Jorden Terrazas dkk.

    Theory and Applications of Graphs, Vol. 11 No. 1 · 2024 · Inggris · DOAJ Scopus

    Given a graph $G$, the zero forcing number of $G$, $Z(G)$, is the smallest cardinality of any set $S$ of vertices on which repeated applications of the forcing rule (described below) results in all vertices being in $S$. The forcing rule is as follows: if a vertex $v$ is in $S$, and exactly one…