Results 81 to 90 of about 1,080,603 (189)
The n-th Power Signed Graphs-II [PDF]
, 2010 For standard terminology and notion in graph theory we refer the reader to Harary [6]; the non-standard will be given in this paper as and when required.
Reddyy, P. Siva Kota +2 more
core +1 more source
Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs [PDF]
Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph $T(G)$ has the triangles of the graph $G$ as its vertices,
Novick, B., Laskar, R.C., Mulder, H.M.
core
Bond graphs in model matching control [PDF]
, 2006 Bond graphs are primarily used in the network modeling of lumped parameter physical systems, but controller design with this graphical technique is relatively unexplored.
Ballance, D.J., Vink, D., Gawthrop, P.J.
core +1 more source
Mapana - Journal of Sciences, 2010 For a graph G, let G, L(G), J(G) S(G), L,(G) and M(G) denote Complement, Line graph, Jump graph, Splitting graph, Line splitting graph and Middle graph respectively. In this paper, we solve the graph equations L(G) =S(H), M(G) = S(H), L(G) = LS(H), M(G) =LS(H), J(G) = S(H), M(G) = S(H), J(G) = LS(H) and M(G) = LS(G).
B. Basavanagoud, Veena Mathad
openaire +2 more sources
Developments on Spectral Characterizations of Graphs [PDF]
In [E.R. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241-272] we gave a survey of answers to the question of which graphs are determined by the spectrum of some matrix associated to the graph.
Dam, E.R. van, Haemers, W.H.
core
Independent Complementary Distance Pattern Uniform Graphs [PDF]
, 2009 A graph G =(V,E) is called to be Smarandachely uniform k-graph for an integer k ≥ 1ifthereexistsM1,M2, ·· ·,Mk ⊂ V (G) such that fMi (u) ={d(u, v):v ∈ Mi} for ∀u ∈ V (G)−Mi is independent of the choice of u ∈ V (G)−Mi and integer i, 1 ≤ i ≤ k.
Koshy, Beena +3 more
core +1 more source
ASA-graphs for efficient data representation and processing
International Journal of Applied Mathematics and Computer Science, 2020 Fast discovering of various relationships in data is an important feature of modern data mining, cognitive, knowledge-based, and explainable AI systems, including deep neural networks.
Horzyk Adrian +2 more
doaj +1 more source
Median computation in graphs using consensus strategies [PDF]
Following the Majority Strategy in graphs, other consensus strategies, namely Plurality Strategy, Hill Climbing and Steepest Ascent Hill Climbing strategies on graphs are discussed as methods for the computation of median sets of profiles.
Changat, M. +2 more
core
Measurement distortion of graphs in corporate reports: an experimental study [PDF]
, 2002 Graphs in corporate annual reports are a double-edged sword. While they offer the potential for improved communication of accounting information to users, the preparers of the annual reports can easily manipulate the graphs for their own interests.
Beattie, V A +5 more
core +1 more source