The server is under maintenance between 08:00 to 12:00 (GMT+08:00), and please visit later.
We apologize for any inconvenience caused
Login  | Sign Up  |  Oriprobe Inc. Feed
China/Asia On Demand
Journal Articles
Laws/Policies/Regulations
Companies/Products
Bookmark and Share
Domination Numbers of Strong Products and Lexicographic Products of Graphs
Author(s): 
Pages: 7-9
Year: Issue:  3
Journal: Journal of Wuyi University(Natural Science Edition)

Keyword:  强乘积图字典乘积图控制数全控制数;
Abstract: 证明了:1)图G和H的强乘积图G⊕H的控制数γ(G⊕H)≤γ(G)γ(H),并举例说明此上界是可以达到的;2)若γ(H)=1,则G与H的字典乘积图的控制数γ(G°H)=γ(G);若G不含孤立点并且γ(H)≥2,则γ(G°H)=γt(G),其中γt表示图的全控制数.
Related Articles
No related articles found