Results 11 to 20 of about 63,555 (259)
The H-Line Signed Graph of a Signed Graph [PDF]
, 2010 For standard terminology and notion in graph theory we refer the reader to Harary; the non-standard will be given in this paper as and when required.
Reddy, Siva Kota +2 more
core +1 more source
, 2009 For standard terminology and notion in graph theory we refer the reader to Harary [7]; the non-standard will be given in this paper as and when required.
Reddy, P. Siva Kota +3 more
core +1 more source
Labeling, Covering and Decomposing of Graphs — Smarandache’s Notion in Graph Theory [PDF]
, 2010 This paper surveys the applications of Smarandache’s notion to graph theory appeared in International J.Math.Combin. from Vol.1,2008 to Vol.3,2009.
Mao, Linfan, Linfan Mao
core +1 more source
Graph geometry from effective resistances
, 2023 The main subject of this thesis is the effective resistance — a measure of distance between the nodes of a graph which reflects how close or well- connected two nodes are, taking into account all paths between them and their interconnections.
Devriendt, Karel
core +1 more source
Chip-Firing on the Complete Split Graph: Motzkin Words and Tiered Parking Functions
, 2023 EuroComb 2021: Online European Conference on Combinatorics, Graph Theory and Applications, Barcelona, Spain, 6-10 September 2021We highlight some results from studying chip-firing on the the complete split graph [5].
Dukes, Mark
core +1 more source
Smarandache-Zagreb Index on Three Graph Operators [PDF]
, 2010 Many researchers have studied several operators on a connected graph in which one make an attempt on subdivision of its edges. In this paper, we show how the Zagreb indices, a particular case of Smarandache-Zagreb index of a graph changes with these ...
Ranjini, P.S., Lokesha, V.
core +1 more source
Total Minimal Dominating Signed Graph [PDF]
, 2010 Cartwright and Harary considered graphs in which vertices represent persons and the edges represent symmetric dyadic relations amongst persons each of which designated as being positive or negative according to whether the nature of the relationship is ...
Reddy, Siva Kota, Vijay, S.
core +1 more source
Graph Guessing Games and Non-Shannon Information Inequalities [PDF]
, 2016 Guessing games for directed graphs were introduced by Riis [12] for studying multiple unicast network coding problems. In a guessing game, the players toss generalised dice and can see some of the other outcomes depending on the structure of an ...
Vaughan, ER +9 more
core +1 more source
, 2021 U ovom radu obrađene su tri primjene teorije grafova. Nakon pregleda osnovnih koncepata teorije grafova slijedi kratka analiza problema najkraćeg puta i primjer rješenja Dijkstrinim algoritmom te se navode neke primjene.
Prkačin, Barbara
core
ORDER CONSOLIDATION PROBLEM ON GRAPHS WITH CUBICITY P
, 2020 We consider the problem of consolidating compatible orders for a batch production process where its downstream process differentiates its output to yield final products that are characterized by p different attributes. In particular, we consider the case
Kim, Jae J. +5 more
core +1 more source