Results 71 to 80 of about 1,017,247 (314)
End Behavior of the Threshold Protocol Game on Complete and Bipartite Graphs
GamesThe threshold protocol game is a graphical game that models the adoption of an idea or product through a population. There are two states players may take in the game, and the goal of the game is to motivate the state that begins in the minority to ...
Alexandra Fedrigo
doaj +1 more source
Regularity of binomial edge ideals of Cohen-Macaulay bipartite graphs [PDF]
Communications in Algebra, 2018 Let G be a finite simple graph on n vertices and JG denote the corresponding binomial edge ideal in We compute the Castelnuovo-Mumford regularity of when JG is the binomial edge ideal of a Cohen-Macaulay bipartite graph.
A. V. Jayanthan, Arvind Kumar
semanticscholar +1 more source
On the number of pentagons in triangle-free graphs [PDF]
, 2013 Using the formalism of flag algebras, we prove that every triangle-free graph G with n vertices contains at most (n/5)(5) cycles of length five. Moreover, the equality is attained only when n is divisible by five and G is the balanced blow-up of the ...
Hatami, Hamed +4 more
core +1 more source
H-Relation Personalized Communication Strategy
Computer Science, 2010 This paper considers the communication patterns arising from the partition of geometricaldomain into sub-domains, when data is exchanged between processors assigned to adjacentsub-domains.
Maciej Paszyński
doaj +1 more source
Theory and Applications of Graphs, 2020 In his classical paper [14], Rosa introduced a hierarchical series of labelings called ρ, σ, β and α labeling as a tool to settle Ringel’s Conjecture which states that if T is any tree with m edges then the complete graph K2m+1 can be decomposed into 2m +
G. Sethuraman, M. Sujasree
doaj +1 more source
Extremal Graphs for Sombor Index with Given Parameters
Axioms, 2023 In this paper, we present the upper and lower bounds on Sombor index SO(G) among all connected graphs (respectively, connected bipartite graphs). We give some sharp lower and upper bounds on SO(G) among connected graphs in terms of some parameters ...
Wanping Zhang, Jixiang Meng, Na Wang
doaj +1 more source
Approximation hardness of dominating set problems in bounded degree graphs [PDF]
, 2008 We study approximation hardness of the Minimum Dominating Set problem and its variants in undirected and directed graphs. Using a similar result obtained by Trevisan for Minimum Set Cover we prove the first explicit approximation lower bounds for various
Chlebikova, Janka +4 more
core +1 more source
Bipartite dimensions and bipartite degrees of graphs
Discrete Mathematics, 1996 Let \(G=(V,E)\) be an undirected graph with finite nonempty vertex set \(V\) and irreflexive edge set \(E\). The irreflexive complement of \(G\) is denoted by \(G^c=(V,E^c)\) with \(E^c=\{\{u,v\}:u, v\in V, u\neq v, \{u,v\}\not\in E\}\). A cover of a graph \(G\) is a family of complete bipartite subgraphs of \(G\) whose edges cover the edges of \(G ...
Peter C. Fishburn, Peter L. Hammer
openaire +2 more sources
Bounds On Fuzzy Dominator Chromatic Number of Fuzzy Soft Bipartite Graphs
Ratio Mathematica, 2023 An FSG GS(T,V) fuzzy’s soft dominator colouring (FSDC) is a suitable Fuzzy Soft Colouring (FSC) where every node of a colour group is dominated by a vertex of GS(T,V).
Jahir Hussain R, Afya Farhana M
doaj +1 more source
Decomposing dense bipartite graphs into 4-cycles [PDF]
, 2015 Let G be an even bipartite graph with partite sets X and Y such that |Y | is even and the minimum degree of a vertex in Y is at least 95|X|/96. Suppose furthermore that the number of edges in G is divisible by 4.
Nicholas J. Cavenagh +1 more
core