Results 41 to 50 of about 131 (107)
Graceful Labeling of Spider Graphs With at Most Five Legs
Journal of Applied Mathematics, Volume 2025, Issue 1, 2025.A graceful labeling of a graph G with q edges is an injection f from the vertices of G to the set {0, 1, ⋯, q} such that, when each edge uv is assigned the label |f(u) − f(v)|, the resulting edge labels are distinct. A spider graph is a tree with exactly one vertex of degree greater than 2, and this vertex is called the branch vertex. A leg of a spider
A. Panpa +3 more
wiley +1 more source
Picture Fuzzy Incidence Graphs with Application
, 2021 In this research article, we initiate the novel idea of picturefuzzy incidence graphs (PFIGs). We explain some innovative notionscomprising of picture fuzzy cut-vertices, picture fuzzy bridges, picturefuzzy incidence cutpairs, and picture fuzzy incidence
Irfan Nazeer; Department of Mathematics, University of management and technology, Lahore 54770 +1 more
core
A Study on Variants of Status Unequal Coloring in Graphs and Its Properties
Journal of Mathematics, Volume 2024, Issue 1, 2024.Let G∧ be a simple connected graph with vertex set ϑG∧ and edge set ξG∧. The status of a vertex p∈ϑG∧ is defined as ∑q≠pd(p, q). A subset P of ϑG∧ is called a status unequal dominating set (stu‐dominating set) of G∧; for every q∈ϑ−P, there exists p in P such that p and q are adjacent and st(p) ≠ st(q).
Parvathy Gnana Sambandam +4 more
wiley +1 more source
Permutations avoiding connected graphs
, 2017 There is a permutation of the vertices of a tree for which no proper subtree on at least two vertices is mapped to a subtree, if and only if twice the number of its endpoints is less than or equal to the number of points of the tree;Theorem 4.1.
Sauer, Norbert, Zaguia, Imed
core +1 more source
Independence Number, Connectivity and All Fractional (a, b, k)-Critical Graphs
Discussiones Mathematicae Graph Theory, 2019 Let G be a graph and a, b and k be nonnegative integers with 1 ≤ a ≤ b. A graph G is defined as all fractional (a, b, k)-critical if after deleting any k vertices of G, the remaining graph has all fractional [a, b]-factors.
Yuan Yuan, Hao Rong-Xia
doaj +1 more source
On the Isometric Path Partition Problem
Discussiones Mathematicae Graph Theory, 2021 The isometric path cover (partition) problem of a graph consists of finding a minimum set of isometric paths which cover (partition) the vertex set of the graph.
Manuel Paul
doaj +1 more source
Feynman symmetries of the Martin and \(c_2\) invariants of regular graphs [PDF]
For every regular graph, we define a sequence of integers, using the recursion of the Martin polynomial. We prove that this sequence counts spanning tree partitions and thus constitutes the diagonal coefficients of powers of the Kirchhoff polynomial.
Panzer, Erik +3 more
core +1 more source
Gregarious Kite Factorization of Tensor Product of Complete Graphs
Discussiones Mathematicae Graph Theory, 2020 A kite factorization of a multipartite graph is said to be gregarious if every kite in the factorization has all its vertices in different partite sets. In this paper, we show that there exists a gregarious kite factorization of Km × Kn if and only if mn
Tamil Elakkiya A., Muthusamy A.
doaj +1 more source
Arbitrarily Partitionable {2K2, C4}-Free Graphs
Discussiones Mathematicae Graph Theory, 2022 A graph G = (V, E) of order n is said to be arbitrarily partitionable if for each sequence λ = (λ1, λ2, …, λp) of positive integers with λ1 +·…·+λp = n, there exists a partition (V1, V2, …, Vp) of the vertex set V such that Vi induces a connected ...
Liu Fengxia +2 more
doaj +1 more source
Strong Tutte Type Conditions and Factors of Graphs
Discussiones Mathematicae Graph Theory, 2020 Let odd(G) denote the number of odd components of a graph G and k ≥ 2 be an integer. We give sufficient conditions using odd(G − S) for a graph G to have an even factor.
Yan Zheng, Kano Mikio
doaj +1 more source