Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userPrime Vertex Labelings Of Families Of Unicyclic Graphs
193
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
A simple $n$-vertex graph has a prime vertex labeling if the vertices can be injectively labeled with the integers $1, 2, 3,ldots, n$ such that adjacent vertices have relatively prime labels. We will present previously unknown prime vertex labelings for new families of graphs, all of which are special cases of Seoud and Youssefs conjecture that all unicyclic graphs have a prime labeling.
rate research
Read More
A simple and connected $n$-vertex graph has a prime vertex labeling if the vertices can be injectively labeled with the integers $1, 2, 3,ldots, n$, such that adjacent vertices have relatively prime labels. We will present previously unknown prime vertex labelings for new families of graphs including cycle pendant stars, cycle chains, prisms, and generalized books.
A coprime labeling of a simple graph of order $n$ is a labeling in which adjacent vertices are given relatively prime labels, and a graph is prime if the labels used can be taken to be the first $n$ positive integers. In this paper, we consider when ladder graphs are prime and when the corresponding labeling may be done in a cyclic manner around the vertices of the ladder. Furthermore, we discuss coprime labelings for complete bipartite graphs.
In finite group theory, studying the prime graph of a group has been an important topic for almost the past half-century. Recently, prime graphs of solvable groups have been characterized in graph theoretical terms only. This now allows the study of these graphs without any knowledge of the group theoretical background. In this paper we study prime graphs from a linear algebra angle and focus on the class of minimally connected prime graphs introduced in earlier work on the subject. As our main results, we determine the determinants of the adjacency matrices and the spectra of some important families of these graphs.
Sombor index is a novel topological index introduced by Gutman, defined as $SO(G)=sumlimits_{uvin E(G)}sqrt{d_{u}^{2}+d_{v}^{2}}$, where $d_{u}$ denotes the degree of vertex $u$. Recently, Chen et al. [H. Chen, W. Li, J. Wang, Extremal values on the Sombor index of trees, MATCH Commun. Math. Comput. Chem. 87 (2022), in press] considered the Sombor indices of trees with given diameter. For the continue, we determine the maximum Sombor indices for unicyclic graphs with given diameter.
Let $L$ be subset of ${3,4,dots}$ and let $X_{n,M}^{(L)}$ be the number of cycles belonging to unicyclic components whose length is in $L$ in the random graph $G(n,M)$. We find the limiting distribution of $X_{n,M}^{(L)}$ in the subcritical regime $M=cn$ with $c<1/2$ and the critical regime $M=frac{n}{2}left(1+mu n^{-1/3}right)$ with $mu=O(1)$. Depending on the regime and a condition involving the series $sum_{l in L} frac{z^l}{2l}$, we obtain in the limit either a Poisson or a normal distribution as $ntoinfty$.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
