Results 21 to 30 of about 2,715 (247)
THE COST NUMBER AND THE DETERMINING NUMBER OF A GRAPH [PDF]
Journal of Algebraic Systems, 2021 The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has an vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The minimum size of a label class in such a labeling of $G$ with $D(G) = d$ is
S. Alikhani, S. Soltani
doaj +1 more source
AKCE International Journal of Graphs and Combinatorics, 2021 We introduce new labeling called m-bonacci graceful labeling. A graph G on n edges is m-bonacci graceful if the vertices can be labeled with distinct integers from the set such that the derived edge labels are the first n m-bonacci numbers.
Kalpana Mahalingam +1 more
doaj +1 more source
Barekeng, 2022 For a simple, undirected graph G with, at most one isolated vertex and no isolated edges, a labeling f:E(G)→{1,2,…,k1} of positive integers to the edges of G is called irregular if the weights of each vertex of G has a different value.
Fredrylo Alberth Noel Joddy Apituley +2 more
doaj +1 more source
A Unique Characterization of Spectral Extrema for Friendship Graphs
The Electronic Journal of Combinatorics, 2022 Turán-type problem is one of central problems in extremal graph theory. Erdős et al. [J. Combin. Theory Ser. B 64 (1995) 89-100] obtained the exact Turán number of the friendship graph $F_k$ for $n\geq 50k^2$, and characterized all its extremal graphs. Cioabă et al. [Electron. J. Combin.
Mingqing Zhai, Ruifang Liu, Jie Xue 0004
openaire +1 more source
PLoS ONE, 2022 While most social network research focuses on positive relational ties, such as friendship and information exchange, scholars are beginning to examine the dark side of human interaction, where negative connections represent different forms of ...
Cassie McMillan +2 more
doaj +1 more source
The Maximum Spectral Radius of Graphs Without Friendship Subgraphs [PDF]
The Electronic Journal of Combinatorics, 2020 A graph on $2k+1$ vertices consisting of $k$ triangles which intersect in exactly one common vertex is called a $k-$friendship graph and denoted by $F_k$. This paper determines the graphs of order $n$ that have the maximum (adjacency) spectral radius among all graphs containing no $F_k$, for $n$ sufficiently large.
Sebastian M. Cioaba +3 more
openaire +2 more sources
Modular Irregular Labeling on Double-Star and Friendship Graphs
Journal of Mathematics, 2021 A modular irregular graph is a graph that admits a modular irregular labeling. A modular irregular labeling of a graph G of order n is a mapping of the set of edges of the graph to 1,2,…,k such that the weights of all vertices are different.
K. A. Sugeng +3 more
doaj +1 more source
On Antimagic Labeling for Some Families of Graphs
Ibn Al-Haitham Journal for Pure and Applied Sciences, 2023 Antimagic labeling of a graph with vertices and edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph are pairwise distinct.
Noor K. Shawkat, Mohammed A. Ahmed
doaj +1 more source
On the spectral determinations of the connected multicone graphs
AKCE International Journal of Graphs and Combinatorics, 2020 In this study we investigate the spectra of the family of connected multicone graphs. A multicone graph is defined to be the join of a clique and a regular graph. Let , and be natural numbers, and let denote a complete graph on vertices.
Ali Zeydi Abdian +6 more
doaj +1 more source
On the Dominant Local Resolving Set of Vertex Amalgamation Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Basically, the new topic of the dominant local metric dimension which be symbolized by Ddim_l (H) is a combination of two concepts in graph theory, they were called the local metric dimension and dominating set. There are some terms in this topic that is
Reni Umilasari +3 more
doaj +1 more source