[图书][B] Handbook of product graphs
RH Hammack, W Imrich, S Klavžar, W Imrich, S Klavžar - 2011 - api.taylorfrancis.com
Every branch of mathematics employs some notion of a product that enables the com-
bination or decomposition of its elemental structures. In graph theory there are four main …
bination or decomposition of its elemental structures. In graph theory there are four main …
Graph homomorphisms: structure and symmetry
G Hahn, C Tardif - Graph symmetry: algebraic methods and applications, 1997 - Springer
This paper is the first part of an introduction to the subject of graph homomorphism in the
mixed form of a course and a survey. We give the basic definitions, examples and uses of …
mixed form of a course and a survey. We give the basic definitions, examples and uses of …
Structure of Fibonacci cubes: a survey
S Klavžar - Journal of Combinatorial Optimization, 2013 - Springer
The Fibonacci cube Γ n is the subgraph of the n-cube induced by the binary strings that
contain no two consecutive 1s. These graphs are applicable as interconnection networks …
contain no two consecutive 1s. These graphs are applicable as interconnection networks …
The dark side of social media: Associations between the Dark Triad of personality, self-disclosure online and selfie-related behaviours
E Sanecka - The Journal of Education, Culture, and Society, 2017 - ceeol.com
The present study investigated the relations between the Dark Triad personality traits (ie,
Machiavellianism, narcissism, and psychopathy), distinct dimensions of self-disclosure …
Machiavellianism, narcissism, and psychopathy), distinct dimensions of self-disclosure …
[HTML][HTML] Estimation of Laplacian spectra of direct and strong product graphs
H Sayama - Discrete Applied Mathematics, 2016 - Elsevier
Calculating a product of multiple graphs has been studied in mathematics, engineering,
computer science, and more recently in network science, particularly in the context of …
computer science, and more recently in network science, particularly in the context of …
Recognizing Cartesian graph bundles
W Imrich, T Pisanski, J Ẑerovnik - Discrete Mathematics, 1997 - Elsevier
Graph bundles generalize the notion of covering graphs and graph products. In this paper
we extend some of the methods for recognizing Cartesian product graphs to graph bundles …
we extend some of the methods for recognizing Cartesian product graphs to graph bundles …
On normal Cayley graphs and hom-idempotent graphs
A graphGis said to behom-idempotentif there is a homomorphism fromG2toG, andweakly
hom-idempotentif for somen≥ 1 there is a homomorphism fromGn+ 1toGn. We characterize …
hom-idempotentif for somen≥ 1 there is a homomorphism fromGn+ 1toGn. We characterize …
[图书][B] Applications of the Helmholtz-Hodge decomposition to networks and random processes
A Strang - 2020 - search.proquest.com
Cycle and potential decompositions are widely used mathematical tools for analyzing
systems across fields. The discrete Hodge-Helmholtz Decomposition (HHD) decomposes an …
systems across fields. The discrete Hodge-Helmholtz Decomposition (HHD) decomposes an …
[HTML][HTML] Algorithm for recognizing Cartesian graph bundles
B Zmazek, J Žerovnik - Discrete applied mathematics, 2002 - Elsevier
Graph bundles generalize the notion of covering graphs and graph products. In, authors
constructed an algorithm that finds a presentation as a nontrivial Cartesian graph bundle for …
constructed an algorithm that finds a presentation as a nontrivial Cartesian graph bundle for …
Partial star products: A local covering approach for the recognition of approximate Cartesian product graphs
M Hellmuth, W Imrich, T Kupka - Mathematics in computer science, 2013 - Springer
This paper is concerned with the recognition of approximate graph products with respect to
the Cartesian product. Most graphs are prime, although they can have a rich product-like …
the Cartesian product. Most graphs are prime, although they can have a rich product-like …