Constructions for cubic graphs with large girth.
Biggs, Norman (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Biggs, Norman (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
T. McKee (1988)
Fundamenta Mathematicae
Similarity:
Gyárfás, András, Zaker, Manouchehr (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Katarzyna Jesse-Józefczyk, Elżbieta Sidorowicz (2014)
Open Mathematics
Similarity:
Consider a graph whose vertices play the role of members of the opposing groups. The edge between two vertices means that these vertices may defend or attack each other. At one time, any attacker may attack only one vertex. Similarly, any defender fights for itself or helps exactly one of its neighbours. If we have a set of defenders that can repel any attack, then we say that the set is secure. Moreover, it is strong if it is also prepared for a raid of one additional foe who can strike...
Stodolsky, B.Y. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hosam Abdo, Darko Dimitrov (2014)
Discussiones Mathematicae Graph Theory
Similarity:
The irregularity of a simple undirected graph G was defined by Albertson [5] as irr(G) = ∑uv∈E(G) |dG(u) − dG(v)|, where dG(u) denotes the degree of a vertex u ∈ V (G). In this paper we consider the irregularity of graphs under several graph operations including join, Cartesian product, direct product, strong product, corona product, lexicographic product, disjunction and sym- metric difference. We give exact expressions or (sharp) upper bounds on the irregularity of graphs under the...
Araya, Makoto, Wiener, Gábor (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Brualdi, Richard A., Mellendorf, Stephen (1994)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sagnik Sen (2014)
Discussiones Mathematicae Graph Theory
Similarity:
In this paper we determine, or give lower and upper bounds on, the 2-dipath and oriented L(2, 1)-span of the family of planar graphs, planar graphs with girth 5, 11, 16, partial k-trees, outerplanar graphs and cacti.
Chartrand, Gary, Saba, Farrokh, Cooper, John K.jun., Harary, Frank, Wall, Curtiss E. (1982)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Jiří Sedláček (1970)
Časopis pro pěstování matematiky
Similarity: