图的Domination染色

图 G 的一个 Domination 染色是使得图 G 的每个顶点 v 控制至少一个色类(可能是自身的色类), 并且每一个色类至少被 G 中一个顶点控制的一个正常染色。 图 G 的 Domination 色数是图 G 的 Domination 染色所需最小的颜色数目,用 χdd(G) 表示。 本文研究了图 G 的 Domination 色数与图 G 通过某种操作得到图 G"的 Domination 色数之间的关系。

Complete Cototal Roman Domination Number of a Graph for User Preference Identification in Social Media

Many graph domination applications can be expanded to achieve complete cototal domination.If every node in a dominating set is regarded as a record server for a PC organization,then each PC affiliated with the organization has direct access to a document server.It is occasionally reasonable to believe that this gateway will remain available even if one of the scrape servers fails.Because every PC has direct access to at least two documents’servers,a complete cototal dominating set provides the required adaptability to non-critical failure in such scenarios.In this paper,we presented a method for calculating a graph’s complete cototal roman domination number.We also examined the properties and determined the bounds for a graph’s complete cototal roman domination number,and its applications are presented.It has been observed that one’s interest fluctuate over time,therefore inferring them just from one’s own behaviour may be inconclusive.However,it may be able to deduce a user’s constant interest to some level if a user’s networking is also watched for similar or related actions.This research proposes a method that considers a user’s and his channel’s activity,as well as common tags,persons,and organizations from their social media posts in order to establish a solid foundation for the required conclusion.

Quantum algorithm for minimum dominating set problem with circuit design

Using quantum algorithms to solve various problems has attracted widespread attention with the development of quantum computing.Researchers are particularly interested in using the acceleration properties of quantum algorithms to solve NP-complete problems.This paper focuses on the well-known NP-complete problem of finding the minimum dominating set in undirected graphs.To expedite the search process,a quantum algorithm employing Grover’s search is proposed.However,a challenge arises from the unknown number of solutions for the minimum dominating set,rendering direct usage of original Grover’s search impossible.Thus,a swap test method is introduced to ascertain the number of iterations required.The oracle,diffusion operators,and swap test are designed with achievable quantum gates.The query complexity is O(1.414^(n))and the space complexity is O(n).To validate the proposed approach,qiskit software package is employed to simulate the quantum circuit,yielding the anticipated results.

Complex adaptive system theory,agent-based modeling,and simulation in dominant technology formation

Dominant technology formation is the key for the hightech industry to“cross the chasm”and gain an established foothold in the market(and hence disrupt the regime).Therefore,a stimulus-response model is proposed to investigate the dominant technology by exploring its formation process and mechanism.Specifically,based on complex adaptive system theory and the basic stimulus-response model,we use a combination of agent-based modeling and system dynamics modeling to capture the interactions between dominant technology and the socio-technical landscape.The results indicate the following:(i)The dynamic interaction is“stimulus-reaction-selection”,which promotes the dominant technology’s formation.(ii)The dominant technology’s formation can be described as a dynamic process in which the adaptation intensity of technology standards increases continuously until it becomes the leading technology under the dual action of internal and external mechanisms.(iii)The dominant technology’s formation in the high-tech industry is influenced by learning ability,the number of adopting users and adaptability.Therein,a“critical scale”of learning ability exists to promote the formation of leading technology:a large number of adopting users can promote the dominant technology’s formation by influencing the adaptive response of technology standards to the socio-technical landscape and the choice of technology standards by the socio-technical landscape.There is a minimum threshold and a maximum threshold for the role of adaptability in the dominant technology’s formation.(iv)The socio-technical landscape can promote the leading technology’s shaping in the high-tech industry,and different elements have different effects.This study promotes research on the formation mechanism of dominant technology in the high-tech industry,presents new perspectives and methods for researchers,and provides essential enlightenment for managers to formulate technology strategies.

Species’ geographical range, environmental range and traits lead to specimen collection preference of dominant plant species of grasslands in Northern China

Many different factors,such as species traits,socio-economic factors,geographical and environmental factors,can lead to specimen collection preference.This study aims to determine whether grassland specimen collection in China is preferred by species traits(i.e.,plant height,flowering and fruiting period),environmental range(i.e.,the temperature and precipitation range)and geographical range(i.e.,distribution range and altitudinal range).Ordinary least squares models and phylogenetic generalized linear mixed models were used to analyze the relationships between specimen number and the explanatory variables.Random Forest models were then used to find the most parsimonious multivariate model.The results showed that interannual variation in specimen number between 1900 and 2020 was considerable.Specimen number of these species in southeast China was notably lower than that in northwest China.Environmental range and geographical range of species had significant positive correlations with specimen number.In addition,there were relatively weak but significant associations between specimen number and species trait(i.e.,plant height and flowering and fruiting period).Random Forest models indicated that distribution range was the most important variable,followed by flowering and fruiting period,and altitudinal range.These findings suggest that future floristic surveys should pay more attention to species with small geographical range,narrow environmental range,short plant height,and short flowering and fruiting period.The correction of specimen collection preference will also make the results of species distribution model,species evolution and other works based on specimen data more accurate.

Dominant woody plant species recognition with a hierarchical model based on multimodal geospatial data for subtropical forests

Since the launch of the Google Earth Engine(GEE)cloud platform in 2010,it has been widely used,leading to a wealth of valuable information.However,the potential of GEE for forest resource management has not been fully exploited.To extract dominant woody plant species,GEE combined Sen-tinel-1(S1)and Sentinel-2(S2)data with the addition of the National Forest Resources Inventory(NFRI)and topographic data,resulting in a 10 m resolution multimodal geospatial dataset for subtropical forests in southeast China.Spectral and texture features,red-edge bands,and vegetation indices of S1 and S2 data were computed.A hierarchical model obtained information on forest distribution and area and the dominant woody plant species.The results suggest that combining data sources from the S1 winter and S2 yearly ranges enhances accuracy in forest distribution and area extraction compared to using either data source independently.Similarly,for dominant woody species recognition,using S1 winter and S2 data across all four seasons was accurate.Including terrain factors and removing spatial correlation from NFRI sample points further improved the recognition accuracy.The optimal forest extraction achieved an overall accuracy(OA)of 97.4%and a maplevel image classification efficacy(MICE)of 96.7%.OA and MICE were 83.6%and 80.7%for dominant species extraction,respectively.The high accuracy and efficacy values indicate that the hierarchical recognition model based on multimodal remote sensing data performed extremely well for extracting information about dominant woody plant species.Visualizing the results using the GEE application allows for an intuitive display of forest and species distribution,offering significant convenience for forest resource monitoring.

Safety and efficacy of transcatheter arterial embolization in autosomal dominant polycystic kidney patients with gross hematuria: Six case reports

BACKGROUND To retrospectively report the safety and efficacy of renal transcatheter arterial embolization for treating autosomal dominant polycystic kidney disease(ADPKD)patients with gross hematuria.CASE SUMMARY The purpose of this study is to retrospectively report the safety and efficacy of renal transcatheter arterial embolization for treating ADPKD patients with gross hematuria.Materials and methods:During the period from January 2018 to December 2019,renal transcatheter arterial embolization was carried out on 6 patients with polycystic kidneys and gross hematuria.Renal arteriography was performed first,and then we determined the location of the hemorrhage and performed embolization under digital subtraction angiography monitoring.Improvements in routine blood test results,routine urine test results,urine color and postoperative reactions were observed and analyzed.Results:Renal transcatheter arterial embolization was successfully conducted in 6 patients.The indices of 5 patients and the color of gross hematuria improved after surgery compared with before surgery.No severe complication reactions occurred.CONCLUSION For autosomal dominant polycystic kidney syndrome patients with gross hematuria,transcatheter arterial embolization was safe and effective.

A Reference Vector-Assisted Many-Objective Optimization Algorithm with Adaptive Niche Dominance Relation

It is still a huge challenge for traditional Pareto-dominatedmany-objective optimization algorithms to solve manyobjective optimization problems because these algorithms hardly maintain the balance between convergence and diversity and can only find a group of solutions focused on a small area on the Pareto front,resulting in poor performance of those algorithms.For this reason,we propose a reference vector-assisted algorithmwith an adaptive niche dominance relation,for short MaOEA-AR.The new dominance relation forms a niche based on the angle between candidate solutions.By comparing these solutions,the solutionwith the best convergence is found to be the non-dominated solution to improve the selection pressure.In reproduction,a mutation strategy of k-bit crossover and hybrid mutation is used to generate high-quality offspring.On 23 test problems with up to 15-objective,we compared the proposed algorithm with five state-of-the-art algorithms.The experimental results verified that the proposed algorithm is competitive.

Vector Dominance with Threshold Searchable Encryption (VDTSE) for the Internet of Things

The Internet of Medical Things(IoMT)is an application of the Internet of Things(IoT)in the medical field.It is a cutting-edge technique that connects medical sensors and their applications to healthcare systems,which is essential in smart healthcare.However,Personal Health Records(PHRs)are normally kept in public cloud servers controlled by IoMT service providers,so privacy and security incidents may be frequent.Fortunately,Searchable Encryption(SE),which can be used to execute queries on encrypted data,can address the issue above.Nevertheless,most existing SE schemes cannot solve the vector dominance threshold problem.In response to this,we present a SE scheme called Vector Dominance with Threshold Searchable Encryption(VDTSE)in this study.We use a Lagrangian polynomial technique and convert the vector dominance threshold problem into a constraint that the number of two equal-length vectors’corresponding bits excluding wildcards is not less than a threshold t.Then,we solve the problem using the proposed technique modified in Hidden Vector Encryption(HVE).This technique makes the trapdoor size linear to the number of attributes and thus much smaller than that of other similar SE schemes.A rigorous experimental analysis of a specific application for privacy-preserving diabetes demonstrates the feasibility of the proposed VDTSE scheme.

关于图的积的Domination数

关于图的积的Ｄｏｍｉｎａｔｉｏｎ数康丽英，单而芳（石家庄铁道学院基础部石家庄０５００４３）（石家庄师专数学系石家庄０５００４１）关键词：图；θ－图；Ｄｏｍｉｎａｔｉｎｇ集ＡＭＳ（１９９１）主题分类：０５Ｃ３５．本文所讨论的图均为无环、无重边的有限简单...

关于图的连通DOMINATION的若干结果

设G是n阶连通图.γ_c(G),d_c(G),i(G)和ir(G)分别表示G图的连通Domination数,连通Domatic数,独立Domination数和Irredundance数,k(G)表示G的连通度.本文证明了下列结论. (1) 如n≥3,则i(G)+γ_c(G)≤n+[n/3]-2; (2) γ_c(G)≤4ir(G)-2; (3) γ_c(G)≤k(G)+1; (4) 如G≠K_n,则d_c(G)≤k(G). 此外,本文给出了满足等式γ_c(G)+γ_c(G)=n和γ_c(G)+γ_c(G)=n+1的图G的一个特征.

Signed Roman (Total) Domination Numbers of Complete Bipartite Graphs and Wheels

A signed(res. signed total) Roman dominating function, SRDF(res.STRDF) for short, of a graph G =(V, E) is a function f : V → {-1, 1, 2} satisfying the conditions that(i)∑v∈N[v]f(v) ≥ 1(res.∑v∈N(v)f(v) ≥ 1) for any v ∈ V, where N [v] is the closed neighborhood and N(v) is the neighborhood of v, and(ii) every vertex v for which f(v) =-1 is adjacent to a vertex u for which f(u) = 2. The weight of a SRDF(res. STRDF) is the sum of its function values over all vertices.The signed(res. signed total) Roman domination number of G is the minimum weight among all signed(res. signed total) Roman dominating functions of G. In this paper,we compute the exact values of the signed(res. signed total) Roman domination numbers of complete bipartite graphs and wheels.

On Minus Paired-Domination in Graphs

The study of minus paired domination of a graph G=(V,E) is initiated. Let SV be any paired dominating set of G , a minus paired dominating function is a function of the form f∶V→{-1,0,1} such that f(v)= 1 for v∈S, f(v)≤0 for v∈V-S , and f(N)≥1 for all v∈V . The weight of a minus paired dominating function f is w(f)=∑f(v) , over all vertices v∈V . The minus paired domination number of a graph G is γ - p( G )=min{ w(f)|f is a minus paired dominating function of G }. On the basis of the minus paired domination number of a graph G defined, some of its properties are discussed.

Signed Total Domination in Graphs

Let G=(V,E) be a simple graph. For any real valued function f:V →R, the weight of f is f(V) = ∑f(v) over all vertices v∈V . A signed total dominating function is a function f:V→{-1,1} such that f(N(v)) ≥1 for every vertex v∈V . The signed total domination number of a graph G equals the minimum weight of a signed total dominating function on G . In this paper, some properties of the signed total domination number of a graph G are discussed.

Signed total domination in nearly regular graphs

A function f： V（ G）→{1,1} defined on the vertices of a graph G is a signed total dominating function （STDF） if the sum of its function values over any open neighborhood is at least one. An STDF f is minimal if there does not extst a STDF g： V（G）→{-1,1}, f≠g, for which g （ v ）≤f（ v ） for every v∈V（ G ）. The weight of a STDF is the sum of its function values over all vertices. The signed total domination number of G is the minimum weight of a STDF of G, while the upper signed domination number of G is the maximum weight of a minimal STDF of G, In this paper, we present sharp upper bounds on the upper signed total domination number of a nearly regular graph.

图的笛卡儿积的Domination数

对某些图类证明了 Vizing 猜想.设 G 为任意一个图,若图 H 满足下列条件之一,则 y(G×H)≥y(G)y(H):①图 H 为 n-圈 C_n;②y(H)≤2;③y(H)=n,H 中至少含有 n-2条互不邻接的端线.

Power domination in planar graphs with small diameter

The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well-known vertex covering and dominating set problems in graph theory. In this paper, it was shown that the power domination number of an outerplanar graph with the diameter two or a 2-connected outerplanar graph with the diameter three is precisely one. Upper bounds on the power domination number for a general planar graph with the diameter two or three were determined as an immediate consequences of results proven by Dorfling, et al. Also, an infinite family of outerplanar graphs with the diameter four having arbitrarily large power domination numbers were given.

CONVEX CONCENTRATION INEQUALITIES FOR CONTINUOUS GAS AND STOCHASTIC DOMINATION

In this article, we consider the continuous gas in a bounded domain ∧ of R^＋ or R^d described by a Gibbsian probability measure μη∧ associated with a pair interaction φ, the inverse temperature β, the activity z 〉 0, and the boundary condition η. Define F ∫ωf（s）wA（ds）. Applying the generalized Ito＇s formula for forward-backward martingales （see Klein et M. [5]）, we obtain convex concentration inequalities for F with respect to the Gibbs measure μη∧. On the other hand, by FKG inequality on the Poisson space, we also give a new simple argument for the stochastic domination for the Gibbs measure.

Dominating Sets and Domination Polynomials of Square of Paths

Let G = (V, E) be a simple graph. A set S í V is a dominating set of G, if every vertex in V-S is adjacent to at least one vertex in S. Let be the square of the Path and let denote the family of all dominating sets of with cardinality i. Let . In this paper, we obtain a recursive formula for . Using this recursive formula, we construct the polynomial, , which we call domination polynomial of and obtain some properties of this polynomial.

The Signed Domination Number of Cartesian Product of Two Paths

Let G be a finite connected simple graph with vertex set V(G) and edge set E(G). A function f:V(G) → {1,1} is a signed dominating function if for every vertex v∈V(G), the closed neighborhood of v contains more vertices with function values 1 than with −1. The signed domination number γs(G) of G is the minimum weight of a signed dominating function on G. In this paper, we calculate The signed domination numbers of the Cartesian product of two paths Pm and Pn for m = 3, 4, 5 and arbitrary n.