Social marketing communication (social marcom) campaign production can be more challenging when the audience includes individuals from ‘culturally and linguistically diverse’ (CALD) communities. Additional issues such as culturally related values, practices, and attitudes need consideration. Normally, social marcoms campaigns for CALD audiences involve directly translating mainstream campaign m...

In light of recent data showing that both helper and cytotoxic T cells can detect even a single molecule of an agonist peptide-MHC, alphabeta T cells are clearly a type of sensory cell, comparable to any in the nervous system. In addition, endogenous (self) peptides bound to MHCs are not just important for thymic selection, but also play an integral role in T cell activation in the response to ...

Lower bounds on the Ramsey number r(G, H), as a function of the size of the graphs G and H, are determined. In particular, if H is a graph with n lines, lower bounds for r(H) = r(H, H) and r(K,, H) are calculated in terms of n in the first case and m and n in the second case. For m = 3 an upper bound is also determined. These results partially answer a question raised by Harary about the relati...

The Harary-Hill conjecture, still open after more than 50 years, asserts that the crossing number of the complete graph Kn is H(n) = 1 4 ⌊ n 2 ⌋⌊ n− 1 2 ⌋⌊ n− 2 2 ⌋⌊ n− 3 2 ⌋ . Ábrego et al. [3] introduced the notion of shellability of a drawing D of Kn. They proved that if D is s-shellable for some s ≥ b 2 c, then D has at least H(n) crossings. This is the first combinatorial condition on a dr...

In an effort to continue the pioneering work of Harary in USA and Flament in France, we have undertaken to develop, on an experimental basis, a formalized theory of systems of beliefs and their modifications. This theory uses the psycho-social concepts of theories of cognitive consistency and of the tools of discrete mathematics, such as rewriting and intervals within graphs. The axioms and rew...

A linear forest-factor F of a graph G is a spanning subgraph of G whose components are paths. A linear forest-decomposition of G is a collection :F = {F1, ••• , Fk } of linear forest-factors of G such that the edge set E (G) of G is the disjoint union of E (F1), •.• , E (Fk)' The linear ar borici ty la( G) of G is the minimum cardinality of a linear forest-decomposition of G. In this paper we e...

The geodetic problem was introduced by Harary et al. [17]. In order to model some social network problems, a similar problem is introduced in this paper and named the strong geodetic problem. The problem is solved for complete Apollonian networks. It is also proved that in general the strong geodetic problem is NP-complete.

The relationship between the Randic , Wiener, Hosoya , Balaban, Schultz indices, Harary numbers andDistance matrix to enthalpies of formation (Airf), heat capacity, (Cp) , enthalpies of combustion (AH °c ),enthalpy of vaporization (AH °vap) and normal boiling points (bpK)of C2 C10 normal alkanes isrepresented