Results 171 to 180 of about 231 (206)

A tutorial on Bayesian model averaging for exponential random graph models

British Journal of Mathematical and Statistical Psychology, EarlyView.
Abstract The use of exponential random graph models (ERGMs) is becoming prevalent in psychology due to their ability to explain and predict the formation of edges between vertices in a network. Valid inference with ERGMs requires correctly specifying endogenous and exogenous effects as network statistics, guided by theory, to represent the network ...
Ihnwhi Heo, Jan‐Willem Simons, Haiyan Liu   +2 more
wiley   +1 more source

Special Issue: Abstracts of the 11^th Congress of the European Academy of Neurology, Helsinki, Finland. [PDF]

Eur J Neurol
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Adjacent vertex distinguishing total colorings of outerplanar graphs

Journal of Combinatorial Optimization, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Yiqiao, Wang, Weifan
openaire   +4 more sources

The adjacent vertex distinguishing total coloring of planar graphs

Journal of Combinatorial Optimization, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Weifan, Huang, Danjun
openaire   +4 more sources

Adjacent vertex distinguishing total coloring in split graphs

Discrete Mathematics, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Verma, Shaily, Fu, Hung-Lin, Panda, B. S.   +2 more
openaire   +2 more sources

Incidence Adjacent Vertex-Distinguishing Total Coloring of Graphs

2009 International Conference on Computational Intelligence and Software Engineering, 2009
Let G(V, E) be a simple graph,k is a positive integer.f is a mapping from V (G) ∪ E(G) to {1, 2, ··· ,k } such that ∀uv ∈ E(G),then f (u) = f (v); ∀uv, vw ∈ E(G) ,u = w, f(uv) = f (vw); ∀uv ∈ E(G) ,C (u) = C(v),we say that f is the incidence-adjacent vertex distinguishing total coloring of G.The minimum number of k is called the incidence-adjacent ...
Zhongfu Zhang, Zhiwen Wang, Enqiang Zhu, Fei Wen, Jingwen Li   +4 more
openaire   +1 more source

Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8

Discrete Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chang, Yulin, Hu, Jie, Wang, Guanghui, Yu, Xiaowei   +3 more
openaire   +1 more source

On the adjacent-vertex-strongly-distinguishing total coloring of graphs

Science in China Series A: Mathematics, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Zhongfu, Cheng, Hui, Yao, Bing, Li, Jingwen, Chen, Xiangen, Xu, Baogen   +5 more
openaire   +2 more sources

On adjacent-vertex-distinguishing total coloring of graphs

Science in China Series A, 2005
In this paper, we present a new concept of the adjacent-vertex-distinguishing total coloring of graphs (briefly, AVDTC of graphs) and, meanwhile, have obtained the adjacent-vertex-distinguishing total chromatic number of some graphs such as cycle, complete graph, complete bipartite graph, fan, wheel and tree.
openaire   +1 more source

The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles

Journal of Combinatorial Optimization, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sun, Lin, Cheng, Xiaohan, Wu, Jianliang
openaire   +1 more source