اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدStrongly Regular Graphs as Laplacian Extremal Graphs
131
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The Laplacian spread of a graph is the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of the graph. We find that the class of strongly regular graphs attains the maximum of largest eigenvalues, the minimum of second-smallest eigenvalues of Laplacian matrices and hence the maximum of Laplacian spreads among all simple connected graphs of fixed order, minimum degree, maximum degree, minimum size of common neighbors of two adjacent vertices and minimum size of common neighbors of two nonadjacent vertices. Some other extremal graphs are also provided.
قيم البحث
اقرأ أيضاً
We consider orbit partitions of groups of automorphisms for the symplectic graph and apply Godsil-McKay switching. As a result, we find four families of strongly regular graphs with the same parameters as the symplectic graphs, including the one disc
overed by Abiad and Haemers. Also, we prove that switched graphs are non-isomorphic to each other by considering the number of common neighbors of three vertices.
In this paper, we simplify the known switching theorem due to Bose and Shrikhande as follows. Let $G=(V,E)$ be a primitive strongly regular graph with parameters $(v,k,lambda,mu)$. Let $S(G,H)$ be the graph from $G$ by switching with respect to a
nonempty $Hsubset V$. Suppose $v=2(k-theta_1)$ where $theta_1$ is the nontrivial positive eigenvalue of the $(0,1)$ adjacency matrix of $G$. This strongly regular graph is associated with a regular two-graph. Then, $S(G,H)$ is a strongly regular graph with the same parameters if and only if the subgraph induced by $H$ is $k-frac{v-h}{2}$ regular. Moreover, $S(G,H)$ is a strognly regualr graph with the other parameters if and only if the subgraph induced by $H$ is $k-mu$ regular and the size of $H$ is $v/2$. We prove these theorems with the view point of the geometrical theory of the finite set on the Euclidean unit sphere.
Davis and Jedwab (1997) established a great construction theory unifying many previously known constructions of difference sets, relative difference sets and divisible difference sets. They introduced the concept of building blocks, which played an i
mportant role in the theory. On the other hand, Polhill (2010) gave a construction of Paley type partial difference sets (conference graphs) based on a special system of building blocks, called a covering extended building set, and proved that there exists a Paley type partial difference set in an abelian group of order $9^iv^4$ for any odd positive integer $v>1$ and any $i=0,1$. His result covers all orders of nonelementary abelian groups in which Paley type partial difference sets exist. In this paper, we give new constructions of strongly regular Cayley graphs on abelian groups by extending the theory of building blocks. The constructions are large generalizations of Polhills construction. In particular, we show that for a positive integer $m$ and elementary abelian groups $G_i$, $i=1,2,ldots,s$, of order $q_i^4$ such that $2m,|,q_i+1$, there exists a decomposition of the complete graph on the abelian group $G=G_1times G_2times cdotstimes G_s$ by strongly regular Cayley graphs with negative Latin square type parameters $(u^2,c(u+1),- u+c^2+3 c,c^2+ c)$, where $u=q_1^2q_2^2cdots q_s^2$ and $c=(u-1)/m$. Such strongly regular decompositions were previously known only when $m=2$ or $G$ is a $p$-group. Moreover, we find one more new infinite family of decompositions of the complete graphs by Latin square type strongly regular Cayley graphs. Thus, we obtain many strongly regular graphs with new parameters.
Given a graph $H$, a graph is $H$-free if it does not contain $H$ as a subgraph. We continue to study the topic of extremal planar graphs, that is, how many edges can an $H$-free planar graph on $n$ vertices have? We define $ex_{_mathcal{P}}(n,H)$ to
be the maximum number of edges in an $H$-free planar graph on $n $ vertices. We first obtain several sufficient conditions on $H$ which yield $ex_{_mathcal{P}}(n,H)=3n-6$ for all $nge |V(H)|$. We discover that the chromatic number of $H$ does not play a role, as in the celebrated ErdH{o}s-Stone Theorem. We then completely determine $ex_{_mathcal{P}}(n,H)$ when $H$ is a wheel or a star. Finally, we examine the case when $H$ is a $(t, r)$-fan, that is, $H$ is isomorphic to $K_1+tK_{r-1}$, where $tge2$ and $rge 3$ are integers. However, determining $ex_{_mathcal{P}}(n,H)$, when $H$ is a planar subcubic graph, remains wide open.
Let $P_n$ and $C_n$ denote the path and cycle on $n$ vertices respectively. The dumbbell graph, denoted by $D_{p,k,q}$, is the graph obtained from two cycles $C_p$, $C_q$ and a path $P_{k+2}$ by identifying each pendant vertex of $P_{k+2}$ with a ver
tex of a cycle respectively. The theta graph, denoted by $Theta_{r,s,t}$, is the graph formed by joining two given vertices via three disjoint paths $P_{r}$, $P_{s}$ and $P_{t}$ respectively. In this paper, we prove that all dumbbell graphs as well as theta graphs are determined by their Laplacian spectra.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
