Zobrazeno 1 - 10
of 29
pro vyhledávání: '"05C69, 05C90"'
Autor:
Interian, Ruben
Moral Foundations Theory proposes that individuals with conflicting political views base their behavior on different principles chosen from a small group of universal moral foundations. This study proposes using a set of widely accepted moral foundat
Externí odkaz:
http://arxiv.org/abs/2406.19878
Autor:
Rather, Bilal Ahmad
In this note we consider the independent domination polynomial problem along with their unimodal and log-concave properties which were earlier studied by G\"ursoy, \"Ulker and G\"ursoy (Soft Comp. 2022). We show that the independent domination polyno
Externí odkaz:
http://arxiv.org/abs/2401.02559
In this work, we investigate the evolution of polarization, influence, and domination in online interaction networks. Twitter data collected before and during the 2022 Brazilian elections is used as a case study. From a theoretical perspective, we de
Externí odkaz:
http://arxiv.org/abs/2303.16859
Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $S\subseteq V$ such that every vertex not in $S$ is adjacent to at least one vertex in $S$. The cardinality of a smallest dominating set of $G$, denoted by $\gamma(G)$, is the domin
Externí odkaz:
http://arxiv.org/abs/2209.02980
Autor:
Meger, Erin, Raz, Abigail
Deterministic complex networks that use iterative generation algorithms have been found to more closely mirror properties found in real world networks than the traditional uniform random graph models. In this paper we introduce a new, Iterative Indep
Externí odkaz:
http://arxiv.org/abs/2209.01093
Polarization arises when the underlying network connecting the members of a community or society becomes characterized by highly connected groups with weak inter-group connectivity. The increasing polarization, the strengthening of echo chambers, and
Externí odkaz:
http://arxiv.org/abs/2207.13799
Graph energy and Domination in graphs are most studied areas of graph theory. In this paper we made an attempt to connect these two areas of graph theory by introducing c-dominating energy of a graph $G$. First, we show the chemical applications of c
Externí odkaz:
http://arxiv.org/abs/1811.06269
Autor:
S, Lakshmi Prabha, Janakiraman, T. N.
There are many indexes (measures or metrics) in Social Network Analysis (SNA), like density, cohesion, etc. We have defined a new SNA index called "comfortability". In this paper, core comfortable team of a social network is defined based on graph th
Externí odkaz:
http://arxiv.org/abs/1406.1012
Autor:
S, Lakshmi Prabha, Janakiraman, T. N.
There are many indexes (measures or metrics) in Social Network Analysis (SNA), like density, cohesion, etc. In this paper, we define a new SNA index called "comfortability". One among the lack of many factors, which affect the effectiveness of a grou
Externí odkaz:
http://arxiv.org/abs/1405.4534
Autor:
Cranston, Daniel W., Yu, Gexin
Publikováno v:
Electronic J. of Combinatorics, R113, Volume 16(1), 2009
Given a graph $G$, an identifying code $C \subseteq V(G)$ is a vertex set such that for any two distinct vertices $v_1,v_2\in V(G)$, the sets $N[v_1]\cap C$ and $N[v_2]\cap C$ are distinct and nonempty (here $N[v]$ denotes a vertex $v$ and its neighb
Externí odkaz:
http://arxiv.org/abs/1006.3779