229 Hits in 4.0 sec

Retractions of split graphs and End-orthodox split graphs

Suohai Fan
2002 Discrete Mathematics  
The retractions of split graphs are given and End-orthodox split graphs are characterized.  ...  A retraction f of a graph G is an edge-preserving mapping of It is known that a graph is End-orthodox if it is End-regular and the composition of any two retractions is also a retraction.  ...  In this paper, we continue to investigate retractions of split graphs and characterize End-orthodox split graphs.  ... 
doi:10.1016/s0012-365x(02)00388-6 fatcat:ygmz3eibsbb4hphrmdz6pkw6ri

Page 5748 of Mathematical Reviews Vol. , Issue 2003h [page]

2003 Mathematical Reviews  
The endomorphism type of bipartite graphs with diameter three and girth six is given in this paper.” 2003h:05098 —05C25 Fan, Suohai (PRC-JNNU; Guangzhou Retractions of split graphs and End-orthodox split  ...  The retractions of split graphs are given and End-orthodox split graphs are characterized.” 2003h:05099 05C25 Fan, Suo Hai (PRC-JNNU; Guangzhou) ; Xie, Hong Ling (PRC-JNNU; Guangzhou) End-regular circulant  ... 

End-Regularity of the Join of n Split Graphs

Hailong Hou, Aifen Feng, Rui Gu
2013 Research Journal of Applied Sciences Engineering and Technology  
A graph X is said to be End-regular if its endomorphism monoid End (X) is a regular semigroup. In this study, End-regular graphs which are the join of n split graphs are characterized.  ...  We give the conditions under which the endomorphism monoid of the join of n splits graphs is regular.  ...  END-REGULAR JOINS OF n SPLIT GRAPHS The End-regular split graphs have been characterized in Lemma 5 and 6.  ... 
doi:10.19026/rjaset.5.4908 fatcat:loz7ks524zem3e2k2mtc4wsc7m

End-regular and End-orthodox generalized lexicographic products of bipartite graphs

Rui Gu, Hailong Hou
2016 Open Mathematics  
AbstractA graph  ...  Acknowledgement: The authors wish to express their gratitude to the referees for their helpful suggestions and comments. This  ...  If X is End-orthodox and Y is a retract of X , then Y is End-orthodox. Proof. Since X is End-orthodox, X is End-regular. Let Y be a retract of X . By Lemma 1.3, Y is End-regular.  ... 
doi:10.1515/math-2016-0021 fatcat:d33jovc7hvfn5kuzrxiy4ijvwu

Generalized symmetry of graphs — A survey

Suohai Fan
2009 Discrete Mathematics  
Symmetry of graphs has been extensively studied over the past fifty years by using automorphisms of graphs and group theory which have played and still play an important role for graph theory, and promising  ...  and interesting results have been obtained, see for examples, [L.W.  ...  The work was partially supported by the National NSF of China 19901012, 10671076 and Guangdong NSF 031904.  ... 
doi:10.1016/j.disc.2009.02.027 fatcat:e5d2g7vyq5aahg4jqfzrmojfwe

Author index to volume

2002 Discrete Mathematics  
Ngo and G.W. Peck, On connectivity of consecutive-, S., Retractions of split graphs and End-orthodox split graphs (Note) (1) 161-164 Favaron, O., see C. Delorme (1) 29-38 Fish, J.M., R.  ...  Klimmek and K. Seyffarth, Line graphs of complete multipartite graphs have small cycle double covers (1) 39-61 F . uredi, Z., A. Gy! arf! as and M. Ruszink !  ... 
doi:10.1016/s0012-365x(02)00700-8 fatcat:hkrv7qelo5copoel65lcrt6mzi

Unicyclic Graphs Whose Completely Regular Endomorphisms form a Monoid

Rui Cu, Hailong Hou
2020 Mathematics  
In this paper, completely regular endomorphisms of unicyclic graphs are explored. Let G be a unicyclic graph and let c E n d ( G ) be the set of all completely regular endomorphisms of G.  ...  It is shown that c E n d ( G ) forms a submonoid of E n d ( G ) if and only if G is an odd cycle or G = G ( n , m ) for some odd n ≥ 3 and integer m ≥ 1 .  ...  Acknowledgments: The authors want to express their gratitude to the referees for their helpful suggestions and comments.  ... 
doi:10.3390/math8020240 fatcat:llvummkxyzedbm46mmmywqdlxu

Master index to volumes 251-260

2003 Discrete Mathematics  
os' conjecture and projective graphs 252 (2002) 91-101 Fan, S., Retractions of split graphs and End-orthodox split graphs (Note) 257 (2002) 161-164 Faudree, R.J., see J.  ...  Lehel, A finite basis characterization of a-split colorings 257 (2002) 415-421 Haas, W., Binary and ternary codes of covering radius one: some new lower bounds 256 (2002) 161-178 Hadjar, A., see J.  ... 
doi:10.1016/s0012-365x(02)00784-7 fatcat:2c4y6lmnybeuxcqr55ngld7r7e

Asymmetric coevolutionary voter dynamics

Stefan Wieland, Ana Nunes
2013 Physical Review E  
a proselytic strategy, converting their neighbors through personal interactions, and relax to the orthodox opinion according to its representation in the population.  ...  different strategy to promote consensus: orthodox opinion holders spread their opinion via social pressure and rewire their connections following a segregationist strategy; heterodox opinion holders adopt  ...  Acknowledgments Financial support from the Portuguese Foundation for Science and Technology (FCT) under Contract POCTI/ISFL/2/261 is gratefully acknowledged.  ... 
doi:10.1103/physreve.88.062809 pmid:24483513 fatcat:7w6v37rerrfzlexdvioutijm2u

Subject Index Volumes 1–200

2001 Discrete Mathematics  
Erdös and Sós, 4925 Erdös and Szekeres, 4879 Erdös et al., 5529, 5888 Erdös Rubin Taylor, 3815 Erdös Sós Turán, 506 Everett, 2901 Faigle and Sands, 2122 Faudree et al., 4399 Faudree Gould Jacobson  ...  Slater, 5299 Hertz and de Werra, 3748 Hibi, 4839 Hoàng, 3748, 4811 Holton, 1660 Holyer and Cockayne, 1118 Howorka, 2636  ...  , see end block end-faithful, see end faithful end-orthodox, see end orthodox end-preserving, see end preserving end-respecting, see end respecting end-vertex, see end vertex n, q), 1738 a complete graph  ... 
doi:10.1016/s0012-365x(00)00471-4 fatcat:znxg54q6ifgutnhzj3urcw455y

Page 162 of Mathematical Reviews Vol. , Issue Index [page]

Mathematical Reviews  
English summary) 2003h:05097 — Retractions of split graphs and End-orthodox split graphs. (English summary) 2003h:05098 — (with Xie, Hong Ling) End-regular circulant graphs. (Chinese.  ...  (English summary) 2003i:05067 Li, Wei-min Unretractivity and end-regularity of a graph. (English and Chinese sum- maries) 2003c:05111 Lim, Tian Khoon (with Praeger,Cheryl E.)  ... 

Quivers of monoids with basic algebras

Stuart Margolis, Benjamin Steinberg
2012 Compositio Mathematica  
For the subclass of R-trivial monoids, we also provide a semigroup theoretic description of the projective indecomposables and compute the Cartan matrix.  ...  More generally, we reduce the computation of the quiver over a splitting field of a class of monoids that we term rectangular monoids (in the semigroup theory literature the class is known as DO) to representation  ...  The (Gabriel) quiver Q(A) of a finite-dimensional k-algebra A, which is split over k, is the directed graph whose vertex set is the set of isomorphism classes of simple left A-modules.  ... 
doi:10.1112/s0010437x1200022x fatcat:rw5fdjpcx5a7rhj6flufurgzdi

Charts, Indexes, and Files: Surveillance, Information Management, and the Visualization of Subversion in Mainline Protestantism

Michael J. McVicar
2020 Religion and American culture  
Through these three themes, the essay highlights how a network of federal bureaucrats, business leaders, and average citizens used graphs, indexes, and files to interpret mainline, ecumenical Christianity  ...  of information management and visualization in corporate and state bureaucracies; and, third, the rise of voluntary, private surveillance in the wake of World War I.  ...  These religious roundsmen patrolled the boundaries of orthodox Protestantism and guarded it against alleged Communist influence.  ... 
doi:10.1017/rac.2020.13 fatcat:deewtc7gibhpzoqcz2lglsfunm

Before Climategate: Visual strategies to integrate ethos across the "is/ought" divide in the IPCC's Climate Change 2007: Summary for Policy Makers

Lynda Walsh
2010 Poroi  
Although these hearings failed to force a retraction of the graph, its notoriety was sealed.  ...  Until the end of the 19 th century, scientists were expected to moralize the results of their inquiries pro bono publico.  ... 
doi:10.13008/2151-2957.1066 fatcat:ptuaw6yqgrgfrpfoynndi7uwru

On the finitizability problem in algebraic logic; recent results [article]

Tarek Sayed Ahmed
2013 arXiv   pre-print
of Erdos graphs in settling important questions in algebraic logic.  ...  This is a survey article in algebraic logic, where we take a magical tour from old concepts due to Henkin, Monk and Tarski like neat embeddings, to modern views and perspectives, culminating in the use  ...  Her response ends the round. The starting graph Γ 0 ∈ G is arbitrary but we will take it to be the empty graph in G.  ... 
arXiv:1302.1368v1 fatcat:bguykr2afvfajda4qskyr265ge
« Previous Showing results 1 — 15 out of 229 results