اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe Partial differential coefficients for the second weghted Bartholdi zeta function of a graph
60
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider the second weighted Bartholdi zeta function of a graph $G$, and present weight
قيم البحث
اقرأ أيضاً
We present the structure theorem for the positive support of the cube of the Grover transition matrix of the discrete-time quantum walk (the Grover walk) on a general graph $G$ under same condition. Thus, we introduce a zeta function on the positive
support of the cube of the Grover transition matrix of $G$, and present its Euler product and its determinant expression. As a corollary, we give the characteristic polynomial for the positive support of the cube of the Grover transition matrix of a regular graph, and so obtain its spectra. Finally, we present the poles and the radius of the convergence of this zeta function.
Let $G$ be a graph of order $n(G)$ and vertex set $V(G)$. Given a set $Ssubseteq V(G)$, we define the external neighbourhood of $S$ as the set $N_e(S)$ of all vertices in $V(G)setminus S$ having at least one neighbour in $S$. The differential of $S$
is defined to be $partial(S)=|N_e(S)|-|S|$. In this paper, we introduce the study of the $2$-packing differential of a graph, which we define as $partial_{2p}(G)=max{partial(S): Ssubseteq V(G) text{ is a }2text{-packing}}.$ We show that the $2$-packing differential is closely related to several graph parameters, including the packing number, the independent domination number, the total domination number, the perfect differential, and the unique response Roman domination number. In particular, we show that the theory of $2$-packing differentials is an appropriate framework to investigate the unique response Roman domination number of a graph without the use of functions. Among other results, we obtain a Gallai-type theorem, which states that $partial_{2p}(G)+mu_{_R}(G)=n(G)$, where $mu_{_R}(G)$ denotes the unique response Roman domination number of $G$. As a consequence of the study, we derive several combinatorial results on $mu_{_R}(G)$, and we show that the problem of finding this parameter is NP-hard. In addition, the particular case of lexicographic product graphs is discussed.
The deck of a graph $G$ is the multiset of cards ${G-v:vin V(G)}$. Myrvold (1992) showed that the degree sequence of a graph on $ngeq7$ vertices can be reconstructed from any deck missing one card. We prove that the degree sequence of a graph with av
erage degree $d$ can reconstructed from any deck missing $O(n/d^3)$ cards. In particular, in the case of graphs that can be embedded on a fixed surface (e.g. planar graphs), the degree sequence can be reconstructed even when a linear number of the cards are missing.
We present an infinite family of Borwein type $+ - - $ conjectures. The expressions in the conjecture are related to multiple basic hypergeometric series with Macdonald polynomial argument.
In this paper we study some classes of second order non-homogeneous nonlinear differential equations allowing a specific representation for nonlinear Greens function. In particular, we show that if the nonlinear term possesses a special multiplicativ
ity property, then its Greens function is represented as the product of the Heaviside function and the general solution of the corresponding homogeneous equations subject to non-homogeneous Cauchy conditions. Hierarchies of specific non-linearities admitting this representation are derived. The nonlinear Greens function solution is numerically justified for the sinh-Gordon and Liouville equations. We also list two open problems leading to a more thorough characterizations of non-linearities admitting the obtained representation for the nonlinear Greens function.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
